./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread/stateful01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/pthread/stateful01-2.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 e2334be94e5a4379173e8ce9878c152630508647bf4da61c6cf055a5b5360d8e --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:32:10,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:32:10,480 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:32:10,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:32:10,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:32:10,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:32:10,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:32:10,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:32:10,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:32:10,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:32:10,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:32:10,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:32:10,509 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:32:10,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:32:10,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:32:10,509 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:32:10,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:32:10,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:32:10,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:32:10,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:32:10,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:32:10,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:32:10,510 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:32:10,510 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:32:10,510 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:32:10,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:32:10,510 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:32:10,510 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:32:10,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:32:10,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:32:10,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:32:10,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:32:10,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:32:10,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:32:10,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:32:10,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:32:10,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:32:10,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:32:10,511 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:32:10,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:32:10,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:32:10,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:32:10,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:32:10,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:32:10,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:32:10,512 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 -> e2334be94e5a4379173e8ce9878c152630508647bf4da61c6cf055a5b5360d8e [2025-04-30 10:32:10,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:32:10,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:32:10,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:32:10,718 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:32:10,718 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:32:10,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stateful01-2.i [2025-04-30 10:32:11,979 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc6463fc/9efcfbe1e3f54472b408b6d73fb23035/FLAG7709c51af [2025-04-30 10:32:12,182 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:32:12,182 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stateful01-2.i [2025-04-30 10:32:12,190 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc6463fc/9efcfbe1e3f54472b408b6d73fb23035/FLAG7709c51af [2025-04-30 10:32:13,030 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc6463fc/9efcfbe1e3f54472b408b6d73fb23035 [2025-04-30 10:32:13,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:32:13,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:32:13,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:32:13,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:32:13,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:32:13,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:32:13" (1/1) ... [2025-04-30 10:32:13,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70fbd588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:13, skipping insertion in model container [2025-04-30 10:32:13,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:32:13" (1/1) ... [2025-04-30 10:32:13,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:32:13,316 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:32:13,327 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:32:13,373 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:32:13,406 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:32:13,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:13 WrapperNode [2025-04-30 10:32:13,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:32:13,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:32:13,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:32:13,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:32:13,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:13" (1/1) ... [2025-04-30 10:32:13,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:13" (1/1) ... [2025-04-30 10:32:13,432 INFO L138 Inliner]: procedures = 168, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2025-04-30 10:32:13,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:32:13,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:32:13,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:32:13,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:32:13,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:13" (1/1) ... [2025-04-30 10:32:13,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:13" (1/1) ... [2025-04-30 10:32:13,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:13" (1/1) ... [2025-04-30 10:32:13,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:13" (1/1) ... [2025-04-30 10:32:13,444 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:13" (1/1) ... [2025-04-30 10:32:13,444 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:13" (1/1) ... [2025-04-30 10:32:13,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:13" (1/1) ... [2025-04-30 10:32:13,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:13" (1/1) ... [2025-04-30 10:32:13,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:13" (1/1) ... [2025-04-30 10:32:13,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:32:13,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:32:13,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:32:13,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:32:13,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:13" (1/1) ... [2025-04-30 10:32:13,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:32:13,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:32:13,471 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-04-30 10:32:13,474 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-04-30 10:32:13,489 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-30 10:32:13,489 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-30 10:32:13,489 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-30 10:32:13,489 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-30 10:32:13,489 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:32:13,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:32:13,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:32:13,489 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:32:13,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:32:13,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:32:13,490 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:32:13,580 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:32:13,581 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:32:13,766 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:32:13,767 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:32:13,785 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:32:13,789 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:32:13,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:32:13 BoogieIcfgContainer [2025-04-30 10:32:13,789 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:32:13,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:32:13,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:32:13,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:32:13,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:32:13" (1/3) ... [2025-04-30 10:32:13,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a703e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:32:13, skipping insertion in model container [2025-04-30 10:32:13,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:13" (2/3) ... [2025-04-30 10:32:13,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a703e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:32:13, skipping insertion in model container [2025-04-30 10:32:13,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:32:13" (3/3) ... [2025-04-30 10:32:13,795 INFO L128 eAbstractionObserver]: Analyzing ICFG stateful01-2.i [2025-04-30 10:32:13,804 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:32:13,807 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stateful01-2.i that has 3 procedures, 140 locations, 140 edges, 1 initial locations, 0 loop locations, and 12 error locations. [2025-04-30 10:32:13,807 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:32:13,856 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-30 10:32:13,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 142 transitions, 298 flow [2025-04-30 10:32:13,925 INFO L116 PetriNetUnfolderBase]: 3/140 cut-off events. [2025-04-30 10:32:13,926 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:32:13,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 140 events. 3/140 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 125 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-04-30 10:32:13,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 142 transitions, 298 flow [2025-04-30 10:32:13,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 123 transitions, 258 flow [2025-04-30 10:32:13,938 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:32:13,944 INFO L340 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;@32dd36e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:32:13,945 INFO L341 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-04-30 10:32:13,955 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:32:13,955 INFO L116 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-04-30 10:32:13,955 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:32:13,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:13,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:32:13,956 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:32:13,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:13,959 INFO L85 PathProgramCache]: Analyzing trace with hash 450545791, now seen corresponding path program 1 times [2025-04-30 10:32:13,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:13,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9379738] [2025-04-30 10:32:13,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:13,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:14,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:32:14,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:32:14,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:14,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:14,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:32:14,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:14,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9379738] [2025-04-30 10:32:14,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9379738] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:14,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:14,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:32:14,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613663351] [2025-04-30 10:32:14,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:14,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:32:14,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:14,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:32:14,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:32:14,189 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 142 [2025-04-30 10:32:14,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 123 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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-04-30 10:32:14,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:14,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 142 [2025-04-30 10:32:14,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:14,310 INFO L116 PetriNetUnfolderBase]: 48/400 cut-off events. [2025-04-30 10:32:14,310 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-30 10:32:14,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 400 events. 48/400 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1763 event pairs, 48 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 447. Up to 117 conditions per place. [2025-04-30 10:32:14,316 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 20 selfloop transitions, 2 changer transitions 0/122 dead transitions. [2025-04-30 10:32:14,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 122 transitions, 300 flow [2025-04-30 10:32:14,317 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:32:14,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:32:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2025-04-30 10:32:14,328 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.863849765258216 [2025-04-30 10:32:14,329 INFO L175 Difference]: Start difference. First operand has 130 places, 123 transitions, 258 flow. Second operand 3 states and 368 transitions. [2025-04-30 10:32:14,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 122 transitions, 300 flow [2025-04-30 10:32:14,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 122 transitions, 292 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:32:14,338 INFO L231 Difference]: Finished difference. Result has 127 places, 122 transitions, 252 flow [2025-04-30 10:32:14,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=127, PETRI_TRANSITIONS=122} [2025-04-30 10:32:14,342 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -3 predicate places. [2025-04-30 10:32:14,342 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 122 transitions, 252 flow [2025-04-30 10:32:14,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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-04-30 10:32:14,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:14,343 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-04-30 10:32:14,343 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:32:14,343 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:32:14,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:14,344 INFO L85 PathProgramCache]: Analyzing trace with hash -779526867, now seen corresponding path program 1 times [2025-04-30 10:32:14,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:14,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622681641] [2025-04-30 10:32:14,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:14,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:14,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:32:14,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:32:14,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:14,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:32:14,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:14,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622681641] [2025-04-30 10:32:14,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622681641] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:14,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:14,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:32:14,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864322825] [2025-04-30 10:32:14,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:14,413 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:32:14,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:14,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:32:14,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:32:14,439 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 142 [2025-04-30 10:32:14,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 122 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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-04-30 10:32:14,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:14,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 142 [2025-04-30 10:32:14,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:14,503 INFO L116 PetriNetUnfolderBase]: 48/399 cut-off events. [2025-04-30 10:32:14,503 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-30 10:32:14,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 399 events. 48/399 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1729 event pairs, 48 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 491. Up to 117 conditions per place. [2025-04-30 10:32:14,505 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 20 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2025-04-30 10:32:14,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 121 transitions, 294 flow [2025-04-30 10:32:14,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:32:14,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:32:14,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2025-04-30 10:32:14,507 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.863849765258216 [2025-04-30 10:32:14,507 INFO L175 Difference]: Start difference. First operand has 127 places, 122 transitions, 252 flow. Second operand 3 states and 368 transitions. [2025-04-30 10:32:14,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 121 transitions, 294 flow [2025-04-30 10:32:14,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 121 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:32:14,509 INFO L231 Difference]: Finished difference. Result has 126 places, 121 transitions, 250 flow [2025-04-30 10:32:14,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=126, PETRI_TRANSITIONS=121} [2025-04-30 10:32:14,509 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -4 predicate places. [2025-04-30 10:32:14,509 INFO L485 AbstractCegarLoop]: Abstraction has has 126 places, 121 transitions, 250 flow [2025-04-30 10:32:14,510 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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-04-30 10:32:14,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:14,510 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] [2025-04-30 10:32:14,510 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:32:14,510 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:32:14,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:14,511 INFO L85 PathProgramCache]: Analyzing trace with hash 951084617, now seen corresponding path program 1 times [2025-04-30 10:32:14,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:14,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210424250] [2025-04-30 10:32:14,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:14,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:14,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-30 10:32:14,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:32:14,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:14,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:14,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:32:14,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:14,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210424250] [2025-04-30 10:32:14,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210424250] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:14,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:14,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:32:14,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018993334] [2025-04-30 10:32:14,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:14,578 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:32:14,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:14,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:32:14,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:32:14,601 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 142 [2025-04-30 10:32:14,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 121 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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-04-30 10:32:14,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:14,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 142 [2025-04-30 10:32:14,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:14,671 INFO L116 PetriNetUnfolderBase]: 84/526 cut-off events. [2025-04-30 10:32:14,671 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-30 10:32:14,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 526 events. 84/526 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2689 event pairs, 38 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 691. Up to 129 conditions per place. [2025-04-30 10:32:14,675 INFO L140 encePairwiseOnDemand]: 132/142 looper letters, 32 selfloop transitions, 7 changer transitions 0/136 dead transitions. [2025-04-30 10:32:14,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 136 transitions, 360 flow [2025-04-30 10:32:14,676 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:32:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:32:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2025-04-30 10:32:14,678 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9084507042253521 [2025-04-30 10:32:14,678 INFO L175 Difference]: Start difference. First operand has 126 places, 121 transitions, 250 flow. Second operand 3 states and 387 transitions. [2025-04-30 10:32:14,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 136 transitions, 360 flow [2025-04-30 10:32:14,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 136 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:32:14,682 INFO L231 Difference]: Finished difference. Result has 127 places, 126 transitions, 300 flow [2025-04-30 10:32:14,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=127, PETRI_TRANSITIONS=126} [2025-04-30 10:32:14,684 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -3 predicate places. [2025-04-30 10:32:14,684 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 126 transitions, 300 flow [2025-04-30 10:32:14,688 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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-04-30 10:32:14,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:14,688 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-04-30 10:32:14,688 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:32:14,688 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:32:14,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:14,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1423405637, now seen corresponding path program 1 times [2025-04-30 10:32:14,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:14,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699536784] [2025-04-30 10:32:14,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:14,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:14,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:32:14,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:32:14,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:14,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:32:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:14,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699536784] [2025-04-30 10:32:14,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699536784] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:14,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:14,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:32:14,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357726379] [2025-04-30 10:32:14,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:14,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:32:14,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:14,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:32:14,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:32:14,765 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 142 [2025-04-30 10:32:14,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 126 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-04-30 10:32:14,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:14,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 142 [2025-04-30 10:32:14,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:14,833 INFO L116 PetriNetUnfolderBase]: 103/616 cut-off events. [2025-04-30 10:32:14,833 INFO L117 PetriNetUnfolderBase]: For 146/160 co-relation queries the response was YES. [2025-04-30 10:32:14,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 616 events. 103/616 cut-off events. For 146/160 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3592 event pairs, 60 based on Foata normal form. 6/565 useless extension candidates. Maximal degree in co-relation 812. Up to 195 conditions per place. [2025-04-30 10:32:14,835 INFO L140 encePairwiseOnDemand]: 136/142 looper letters, 29 selfloop transitions, 7 changer transitions 0/136 dead transitions. [2025-04-30 10:32:14,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 136 transitions, 403 flow [2025-04-30 10:32:14,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:32:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:32:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2025-04-30 10:32:14,836 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8990610328638498 [2025-04-30 10:32:14,837 INFO L175 Difference]: Start difference. First operand has 127 places, 126 transitions, 300 flow. Second operand 3 states and 383 transitions. [2025-04-30 10:32:14,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 136 transitions, 403 flow [2025-04-30 10:32:14,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 136 transitions, 385 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:32:14,839 INFO L231 Difference]: Finished difference. Result has 129 places, 131 transitions, 342 flow [2025-04-30 10:32:14,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=129, PETRI_TRANSITIONS=131} [2025-04-30 10:32:14,840 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -1 predicate places. [2025-04-30 10:32:14,840 INFO L485 AbstractCegarLoop]: Abstraction has has 129 places, 131 transitions, 342 flow [2025-04-30 10:32:14,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-04-30 10:32:14,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:14,840 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] [2025-04-30 10:32:14,840 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:32:14,840 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:32:14,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:14,841 INFO L85 PathProgramCache]: Analyzing trace with hash 106293525, now seen corresponding path program 1 times [2025-04-30 10:32:14,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:14,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538425751] [2025-04-30 10:32:14,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:14,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:14,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:32:14,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:32:14,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:14,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:32:14,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:14,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538425751] [2025-04-30 10:32:14,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538425751] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:14,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:14,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:32:14,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587244763] [2025-04-30 10:32:14,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:14,891 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:32:14,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:14,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:32:14,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:32:14,916 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 142 [2025-04-30 10:32:14,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 131 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-04-30 10:32:14,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:14,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 142 [2025-04-30 10:32:14,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:14,999 INFO L116 PetriNetUnfolderBase]: 122/738 cut-off events. [2025-04-30 10:32:14,999 INFO L117 PetriNetUnfolderBase]: For 279/287 co-relation queries the response was YES. [2025-04-30 10:32:15,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1239 conditions, 738 events. 122/738 cut-off events. For 279/287 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4422 event pairs, 62 based on Foata normal form. 2/661 useless extension candidates. Maximal degree in co-relation 1025. Up to 220 conditions per place. [2025-04-30 10:32:15,001 INFO L140 encePairwiseOnDemand]: 136/142 looper letters, 30 selfloop transitions, 9 changer transitions 0/141 dead transitions. [2025-04-30 10:32:15,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 141 transitions, 455 flow [2025-04-30 10:32:15,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:32:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:32:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2025-04-30 10:32:15,003 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8990610328638498 [2025-04-30 10:32:15,003 INFO L175 Difference]: Start difference. First operand has 129 places, 131 transitions, 342 flow. Second operand 3 states and 383 transitions. [2025-04-30 10:32:15,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 141 transitions, 455 flow [2025-04-30 10:32:15,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 141 transitions, 437 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:32:15,007 INFO L231 Difference]: Finished difference. Result has 131 places, 136 transitions, 396 flow [2025-04-30 10:32:15,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=131, PETRI_TRANSITIONS=136} [2025-04-30 10:32:15,007 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 1 predicate places. [2025-04-30 10:32:15,007 INFO L485 AbstractCegarLoop]: Abstraction has has 131 places, 136 transitions, 396 flow [2025-04-30 10:32:15,008 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-04-30 10:32:15,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:15,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:32:15,008 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:32:15,008 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:32:15,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:15,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1136001590, now seen corresponding path program 1 times [2025-04-30 10:32:15,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:15,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394397222] [2025-04-30 10:32:15,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:15,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:15,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-30 10:32:15,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-30 10:32:15,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:15,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:15,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:32:15,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:15,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394397222] [2025-04-30 10:32:15,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394397222] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:15,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:15,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:32:15,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433351478] [2025-04-30 10:32:15,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:15,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:32:15,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:15,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:32:15,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:32:15,079 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 142 [2025-04-30 10:32:15,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 136 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-04-30 10:32:15,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:15,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 142 [2025-04-30 10:32:15,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:15,148 INFO L116 PetriNetUnfolderBase]: 102/695 cut-off events. [2025-04-30 10:32:15,149 INFO L117 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2025-04-30 10:32:15,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 695 events. 102/695 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4143 event pairs, 44 based on Foata normal form. 1/649 useless extension candidates. Maximal degree in co-relation 986. Up to 146 conditions per place. [2025-04-30 10:32:15,152 INFO L140 encePairwiseOnDemand]: 132/142 looper letters, 30 selfloop transitions, 6 changer transitions 6/151 dead transitions. [2025-04-30 10:32:15,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 151 transitions, 504 flow [2025-04-30 10:32:15,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:32:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:32:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2025-04-30 10:32:15,155 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9061032863849765 [2025-04-30 10:32:15,155 INFO L175 Difference]: Start difference. First operand has 131 places, 136 transitions, 396 flow. Second operand 3 states and 386 transitions. [2025-04-30 10:32:15,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 151 transitions, 504 flow [2025-04-30 10:32:15,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 151 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:32:15,157 INFO L231 Difference]: Finished difference. Result has 132 places, 135 transitions, 413 flow [2025-04-30 10:32:15,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=413, PETRI_PLACES=132, PETRI_TRANSITIONS=135} [2025-04-30 10:32:15,158 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2025-04-30 10:32:15,158 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 135 transitions, 413 flow [2025-04-30 10:32:15,158 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-04-30 10:32:15,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:15,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:32:15,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:32:15,158 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:32:15,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:15,159 INFO L85 PathProgramCache]: Analyzing trace with hash 792898737, now seen corresponding path program 1 times [2025-04-30 10:32:15,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:15,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939127133] [2025-04-30 10:32:15,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:15,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:15,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-04-30 10:32:15,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-04-30 10:32:15,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:15,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:32:15,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:15,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939127133] [2025-04-30 10:32:15,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939127133] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:15,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:15,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:32:15,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973777491] [2025-04-30 10:32:15,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:15,246 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:32:15,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:15,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:32:15,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:32:15,259 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 142 [2025-04-30 10:32:15,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 135 transitions, 413 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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-04-30 10:32:15,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:15,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 142 [2025-04-30 10:32:15,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:15,292 INFO L116 PetriNetUnfolderBase]: 12/237 cut-off events. [2025-04-30 10:32:15,292 INFO L117 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-04-30 10:32:15,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 237 events. 12/237 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 588 event pairs, 4 based on Foata normal form. 8/235 useless extension candidates. Maximal degree in co-relation 180. Up to 27 conditions per place. [2025-04-30 10:32:15,293 INFO L140 encePairwiseOnDemand]: 134/142 looper letters, 8 selfloop transitions, 8 changer transitions 0/109 dead transitions. [2025-04-30 10:32:15,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 109 transitions, 307 flow [2025-04-30 10:32:15,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:32:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:32:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2025-04-30 10:32:15,294 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.92018779342723 [2025-04-30 10:32:15,295 INFO L175 Difference]: Start difference. First operand has 132 places, 135 transitions, 413 flow. Second operand 3 states and 392 transitions. [2025-04-30 10:32:15,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 109 transitions, 307 flow [2025-04-30 10:32:15,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 109 transitions, 255 flow, removed 10 selfloop flow, removed 10 redundant places. [2025-04-30 10:32:15,298 INFO L231 Difference]: Finished difference. Result has 112 places, 107 transitions, 233 flow [2025-04-30 10:32:15,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=233, PETRI_PLACES=112, PETRI_TRANSITIONS=107} [2025-04-30 10:32:15,298 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -18 predicate places. [2025-04-30 10:32:15,298 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 107 transitions, 233 flow [2025-04-30 10:32:15,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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-04-30 10:32:15,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:15,299 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] [2025-04-30 10:32:15,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:32:15,299 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:32:15,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:15,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1314926669, now seen corresponding path program 1 times [2025-04-30 10:32:15,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:15,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346105917] [2025-04-30 10:32:15,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:15,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:15,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-30 10:32:15,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-30 10:32:15,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:15,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:32:15,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:15,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346105917] [2025-04-30 10:32:15,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346105917] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:15,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:15,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:32:15,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844903161] [2025-04-30 10:32:15,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:15,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:32:15,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:15,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:32:15,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:32:15,361 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 142 [2025-04-30 10:32:15,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 107 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-04-30 10:32:15,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:15,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 142 [2025-04-30 10:32:15,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:15,389 INFO L116 PetriNetUnfolderBase]: 19/268 cut-off events. [2025-04-30 10:32:15,390 INFO L117 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-04-30 10:32:15,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 268 events. 19/268 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 792 event pairs, 17 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 222. Up to 70 conditions per place. [2025-04-30 10:32:15,392 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 17 selfloop transitions, 2 changer transitions 4/107 dead transitions. [2025-04-30 10:32:15,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 107 transitions, 274 flow [2025-04-30 10:32:15,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:32:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:32:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2025-04-30 10:32:15,393 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8732394366197183 [2025-04-30 10:32:15,393 INFO L175 Difference]: Start difference. First operand has 112 places, 107 transitions, 233 flow. Second operand 3 states and 372 transitions. [2025-04-30 10:32:15,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 107 transitions, 274 flow [2025-04-30 10:32:15,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 107 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:32:15,394 INFO L231 Difference]: Finished difference. Result has 112 places, 102 transitions, 218 flow [2025-04-30 10:32:15,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=112, PETRI_TRANSITIONS=102} [2025-04-30 10:32:15,395 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -18 predicate places. [2025-04-30 10:32:15,395 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 102 transitions, 218 flow [2025-04-30 10:32:15,395 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-04-30 10:32:15,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:15,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:32:15,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:32:15,395 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:32:15,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:15,396 INFO L85 PathProgramCache]: Analyzing trace with hash 478616355, now seen corresponding path program 1 times [2025-04-30 10:32:15,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:15,396 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757827645] [2025-04-30 10:32:15,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:15,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:15,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-30 10:32:15,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-30 10:32:15,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:15,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:32:15,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:15,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757827645] [2025-04-30 10:32:15,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757827645] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:15,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:15,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:32:15,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61048815] [2025-04-30 10:32:15,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:15,433 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:32:15,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:15,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:32:15,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:32:15,455 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 142 [2025-04-30 10:32:15,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 102 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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-04-30 10:32:15,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:15,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 142 [2025-04-30 10:32:15,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:15,480 INFO L116 PetriNetUnfolderBase]: 16/228 cut-off events. [2025-04-30 10:32:15,481 INFO L117 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-04-30 10:32:15,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 228 events. 16/228 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 584 event pairs, 14 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 201. Up to 59 conditions per place. [2025-04-30 10:32:15,481 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 0 selfloop transitions, 0 changer transitions 102/102 dead transitions. [2025-04-30 10:32:15,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 102 transitions, 257 flow [2025-04-30 10:32:15,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:32:15,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:32:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2025-04-30 10:32:15,482 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8708920187793427 [2025-04-30 10:32:15,482 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 218 flow. Second operand 3 states and 371 transitions. [2025-04-30 10:32:15,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 102 transitions, 257 flow [2025-04-30 10:32:15,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 102 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:32:15,483 INFO L231 Difference]: Finished difference. Result has 107 places, 0 transitions, 0 flow [2025-04-30 10:32:15,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=107, PETRI_TRANSITIONS=0} [2025-04-30 10:32:15,483 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -23 predicate places. [2025-04-30 10:32:15,483 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 0 transitions, 0 flow [2025-04-30 10:32:15,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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-04-30 10:32:15,485 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2025-04-30 10:32:15,487 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-04-30 10:32:15,487 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-04-30 10:32:15,487 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-04-30 10:32:15,487 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-04-30 10:32:15,487 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-04-30 10:32:15,487 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-04-30 10:32:15,487 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-04-30 10:32:15,487 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-04-30 10:32:15,487 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-04-30 10:32:15,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-04-30 10:32:15,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-04-30 10:32:15,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 22 remaining) [2025-04-30 10:32:15,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 22 remaining) [2025-04-30 10:32:15,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-04-30 10:32:15,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-04-30 10:32:15,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-04-30 10:32:15,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-04-30 10:32:15,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-04-30 10:32:15,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-04-30 10:32:15,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-04-30 10:32:15,489 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-04-30 10:32:15,489 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:32:15,489 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:32:15,492 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:32:15,492 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:32:15,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:32:15 BasicIcfg [2025-04-30 10:32:15,497 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:32:15,497 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:32:15,498 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:32:15,498 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:32:15,498 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:32:13" (3/4) ... [2025-04-30 10:32:15,499 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:32:15,501 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-04-30 10:32:15,501 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-04-30 10:32:15,503 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-04-30 10:32:15,504 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-30 10:32:15,504 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-30 10:32:15,504 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-30 10:32:15,560 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:32:15,560 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:32:15,560 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:32:15,561 INFO L158 Benchmark]: Toolchain (without parser) took 2528.27ms. Allocated memory is still 201.3MB. Free memory was 158.2MB in the beginning and 125.9MB in the end (delta: 32.3MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2025-04-30 10:32:15,561 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:32:15,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.12ms. Allocated memory is still 201.3MB. Free memory was 157.9MB in the beginning and 134.9MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:32:15,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.03ms. Allocated memory is still 201.3MB. Free memory was 134.9MB in the beginning and 132.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:32:15,561 INFO L158 Benchmark]: Boogie Preprocessor took 16.28ms. Allocated memory is still 201.3MB. Free memory was 132.8MB in the beginning and 131.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:32:15,561 INFO L158 Benchmark]: RCFGBuilder took 339.48ms. Allocated memory is still 201.3MB. Free memory was 131.7MB in the beginning and 112.9MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:32:15,562 INFO L158 Benchmark]: TraceAbstraction took 1706.94ms. Allocated memory is still 201.3MB. Free memory was 112.4MB in the beginning and 132.6MB in the end (delta: -20.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:32:15,562 INFO L158 Benchmark]: Witness Printer took 62.64ms. Allocated memory is still 201.3MB. Free memory was 132.6MB in the beginning and 125.9MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:32:15,563 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.75ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.12ms. Allocated memory is still 201.3MB. Free memory was 157.9MB in the beginning and 134.9MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.03ms. Allocated memory is still 201.3MB. Free memory was 134.9MB in the beginning and 132.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.28ms. Allocated memory is still 201.3MB. Free memory was 132.8MB in the beginning and 131.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 339.48ms. Allocated memory is still 201.3MB. Free memory was 131.7MB in the beginning and 112.9MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1706.94ms. Allocated memory is still 201.3MB. Free memory was 112.4MB in the beginning and 132.6MB in the end (delta: -20.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 62.64ms. Allocated memory is still 201.3MB. Free memory was 132.6MB in the beginning and 125.9MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 700]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 700]: 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: 710]: 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: 719]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 720]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 725]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 725]: 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, 206 locations, 208 edges, 22 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: 1.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 344 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 485 IncrementalHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 47 mSDtfsCounter, 485 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=413occurred in iteration=6, InterpolantAutomatonStates: 27, 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.4s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 470 ConstructedInterpolants, 0 QuantifiedInterpolants, 504 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-30 10:32:15,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE