./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-atomic/lamport.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/lamport.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 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:36:07,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:36:07,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:36:07,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:36:07,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:36:07,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:36:07,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:36:07,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:36:07,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:36:07,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:36:07,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:36:07,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:36:07,570 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:36:07,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:36:07,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:36:07,571 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:36:07,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:36:07,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:36:07,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:36:07,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:36:07,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:36:07,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:36:07,573 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:36:07,573 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:36:07,573 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:36:07,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:36:07,573 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:36:07,573 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:36:07,573 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:36:07,573 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:36:07,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:36:07,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:36:07,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:36:07,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:36:07,573 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:36:07,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:36:07,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:36:07,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:36:07,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:36:07,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:36:07,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:36:07,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:36:07,573 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 -> 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c [2025-03-08 21:36:07,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:36:07,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:36:07,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:36:07,796 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:36:07,797 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:36:07,797 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/lamport.i [2025-03-08 21:36:08,954 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6d26541c/ab68f34d1ddd43be895b91651b3eb5c4/FLAG467e9dc6a [2025-03-08 21:36:09,229 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:36:09,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i [2025-03-08 21:36:09,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6d26541c/ab68f34d1ddd43be895b91651b3eb5c4/FLAG467e9dc6a [2025-03-08 21:36:09,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6d26541c/ab68f34d1ddd43be895b91651b3eb5c4 [2025-03-08 21:36:09,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:36:09,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:36:09,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:36:09,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:36:09,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:36:09,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:36:09" (1/1) ... [2025-03-08 21:36:09,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154be36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:09, skipping insertion in model container [2025-03-08 21:36:09,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:36:09" (1/1) ... [2025-03-08 21:36:09,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:36:09,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:36:09,551 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:36:09,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:36:09,604 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:36:09,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:09 WrapperNode [2025-03-08 21:36:09,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:36:09,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:36:09,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:36:09,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:36:09,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:09" (1/1) ... [2025-03-08 21:36:09,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:09" (1/1) ... [2025-03-08 21:36:09,635 INFO L138 Inliner]: procedures = 166, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 111 [2025-03-08 21:36:09,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:36:09,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:36:09,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:36:09,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:36:09,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:09" (1/1) ... [2025-03-08 21:36:09,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:09" (1/1) ... [2025-03-08 21:36:09,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:09" (1/1) ... [2025-03-08 21:36:09,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:09" (1/1) ... [2025-03-08 21:36:09,645 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:09" (1/1) ... [2025-03-08 21:36:09,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:09" (1/1) ... [2025-03-08 21:36:09,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:09" (1/1) ... [2025-03-08 21:36:09,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:09" (1/1) ... [2025-03-08 21:36:09,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:36:09,650 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:36:09,650 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:36:09,650 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:36:09,651 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:09" (1/1) ... [2025-03-08 21:36:09,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:36:09,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:36:09,677 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:36:09,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:36:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-03-08 21:36:09,696 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-03-08 21:36:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-08 21:36:09,696 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-08 21:36:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:36:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:36:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:36:09,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:36:09,697 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:36:09,787 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:36:09,789 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:36:09,947 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:36:09,947 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:36:09,970 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:36:09,972 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:36:09,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:36:09 BoogieIcfgContainer [2025-03-08 21:36:09,972 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:36:09,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:36:09,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:36:09,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:36:09,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:36:09" (1/3) ... [2025-03-08 21:36:09,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c90ac6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:36:09, skipping insertion in model container [2025-03-08 21:36:09,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:09" (2/3) ... [2025-03-08 21:36:09,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c90ac6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:36:09, skipping insertion in model container [2025-03-08 21:36:09,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:36:09" (3/3) ... [2025-03-08 21:36:09,980 INFO L128 eAbstractionObserver]: Analyzing ICFG lamport.i [2025-03-08 21:36:09,991 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:36:09,993 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lamport.i that has 3 procedures, 96 locations, 1 initial locations, 8 loop locations, and 4 error locations. [2025-03-08 21:36:09,993 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:36:10,054 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 21:36:10,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 113 transitions, 240 flow [2025-03-08 21:36:10,136 INFO L124 PetriNetUnfolderBase]: 18/111 cut-off events. [2025-03-08 21:36:10,140 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 21:36:10,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 111 events. 18/111 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 219 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 88. Up to 3 conditions per place. [2025-03-08 21:36:10,145 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 113 transitions, 240 flow [2025-03-08 21:36:10,150 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 106 transitions, 221 flow [2025-03-08 21:36:10,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:36:10,167 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@26dba832, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:36:10,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-08 21:36:10,181 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:36:10,182 INFO L124 PetriNetUnfolderBase]: 3/40 cut-off events. [2025-03-08 21:36:10,182 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:36:10,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:10,182 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] [2025-03-08 21:36:10,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:36:10,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:10,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1549209188, now seen corresponding path program 1 times [2025-03-08 21:36:10,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:10,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366318073] [2025-03-08 21:36:10,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:10,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:10,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 21:36:10,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 21:36:10,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:10,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:10,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:10,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:10,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366318073] [2025-03-08 21:36:10,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366318073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:10,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:10,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:10,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520843983] [2025-03-08 21:36:10,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:10,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:36:10,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:10,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:36:10,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:36:10,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2025-03-08 21:36:10,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 106 transitions, 221 flow. Second operand has 2 states, 2 states have (on average 90.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:10,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:10,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2025-03-08 21:36:10,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:10,487 INFO L124 PetriNetUnfolderBase]: 131/470 cut-off events. [2025-03-08 21:36:10,487 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-08 21:36:10,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 470 events. 131/470 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2332 event pairs, 63 based on Foata normal form. 24/395 useless extension candidates. Maximal degree in co-relation 591. Up to 160 conditions per place. [2025-03-08 21:36:10,494 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 17 selfloop transitions, 0 changer transitions 0/98 dead transitions. [2025-03-08 21:36:10,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 98 transitions, 239 flow [2025-03-08 21:36:10,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:36:10,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 21:36:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 201 transitions. [2025-03-08 21:36:10,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8893805309734514 [2025-03-08 21:36:10,505 INFO L175 Difference]: Start difference. First operand has 95 places, 106 transitions, 221 flow. Second operand 2 states and 201 transitions. [2025-03-08 21:36:10,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 98 transitions, 239 flow [2025-03-08 21:36:10,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 98 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 21:36:10,513 INFO L231 Difference]: Finished difference. Result has 91 places, 98 transitions, 200 flow [2025-03-08 21:36:10,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=200, PETRI_PLACES=91, PETRI_TRANSITIONS=98} [2025-03-08 21:36:10,517 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -4 predicate places. [2025-03-08 21:36:10,517 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 98 transitions, 200 flow [2025-03-08 21:36:10,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:10,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:10,517 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] [2025-03-08 21:36:10,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:36:10,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:36:10,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:10,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1182691238, now seen corresponding path program 1 times [2025-03-08 21:36:10,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:10,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206821767] [2025-03-08 21:36:10,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:10,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:10,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 21:36:10,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 21:36:10,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:10,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:10,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:10,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206821767] [2025-03-08 21:36:10,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206821767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:10,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:10,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:10,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564240806] [2025-03-08 21:36:10,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:10,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:10,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:10,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:10,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:10,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 113 [2025-03-08 21:36:10,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 98 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:10,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:10,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 113 [2025-03-08 21:36:10,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:10,745 INFO L124 PetriNetUnfolderBase]: 213/679 cut-off events. [2025-03-08 21:36:10,745 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 21:36:10,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 679 events. 213/679 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3881 event pairs, 111 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 1032. Up to 283 conditions per place. [2025-03-08 21:36:10,753 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 32 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2025-03-08 21:36:10,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 110 transitions, 300 flow [2025-03-08 21:36:10,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:10,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2025-03-08 21:36:10,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8289085545722714 [2025-03-08 21:36:10,755 INFO L175 Difference]: Start difference. First operand has 91 places, 98 transitions, 200 flow. Second operand 3 states and 281 transitions. [2025-03-08 21:36:10,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 110 transitions, 300 flow [2025-03-08 21:36:10,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 110 transitions, 300 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:36:10,762 INFO L231 Difference]: Finished difference. Result has 95 places, 102 transitions, 238 flow [2025-03-08 21:36:10,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=95, PETRI_TRANSITIONS=102} [2025-03-08 21:36:10,767 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 0 predicate places. [2025-03-08 21:36:10,767 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 102 transitions, 238 flow [2025-03-08 21:36:10,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:10,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:10,768 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-03-08 21:36:10,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:36:10,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:36:10,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:10,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1938221270, now seen corresponding path program 1 times [2025-03-08 21:36:10,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:10,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117923050] [2025-03-08 21:36:10,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:10,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:10,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 21:36:10,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 21:36:10,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:10,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:10,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:10,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117923050] [2025-03-08 21:36:10,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117923050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:10,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:10,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:10,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097087433] [2025-03-08 21:36:10,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:10,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:10,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:10,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:10,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:10,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 113 [2025-03-08 21:36:10,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 102 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:10,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:10,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 113 [2025-03-08 21:36:10,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:10,948 INFO L124 PetriNetUnfolderBase]: 210/718 cut-off events. [2025-03-08 21:36:10,948 INFO L125 PetriNetUnfolderBase]: For 87/89 co-relation queries the response was YES. [2025-03-08 21:36:10,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1175 conditions, 718 events. 210/718 cut-off events. For 87/89 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4126 event pairs, 58 based on Foata normal form. 1/607 useless extension candidates. Maximal degree in co-relation 1170. Up to 201 conditions per place. [2025-03-08 21:36:10,952 INFO L140 encePairwiseOnDemand]: 105/113 looper letters, 38 selfloop transitions, 6 changer transitions 5/124 dead transitions. [2025-03-08 21:36:10,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 124 transitions, 391 flow [2025-03-08 21:36:10,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2025-03-08 21:36:10,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8613569321533924 [2025-03-08 21:36:10,955 INFO L175 Difference]: Start difference. First operand has 95 places, 102 transitions, 238 flow. Second operand 3 states and 292 transitions. [2025-03-08 21:36:10,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 124 transitions, 391 flow [2025-03-08 21:36:10,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 124 transitions, 379 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:10,960 INFO L231 Difference]: Finished difference. Result has 97 places, 105 transitions, 274 flow [2025-03-08 21:36:10,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=97, PETRI_TRANSITIONS=105} [2025-03-08 21:36:10,960 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 2 predicate places. [2025-03-08 21:36:10,960 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 105 transitions, 274 flow [2025-03-08 21:36:10,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:10,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:10,961 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] [2025-03-08 21:36:10,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:36:10,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:36:10,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:10,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1121781983, now seen corresponding path program 1 times [2025-03-08 21:36:10,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:10,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763219444] [2025-03-08 21:36:10,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:10,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:10,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 21:36:10,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 21:36:10,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:10,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:11,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:11,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763219444] [2025-03-08 21:36:11,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763219444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:11,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:11,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:11,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311975654] [2025-03-08 21:36:11,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:11,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:11,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:11,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:11,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:11,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 113 [2025-03-08 21:36:11,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 105 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:11,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:11,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 113 [2025-03-08 21:36:11,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:11,132 INFO L124 PetriNetUnfolderBase]: 244/769 cut-off events. [2025-03-08 21:36:11,132 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2025-03-08 21:36:11,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1396 conditions, 769 events. 244/769 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4505 event pairs, 112 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 1390. Up to 325 conditions per place. [2025-03-08 21:36:11,137 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 31 selfloop transitions, 7 changer transitions 4/117 dead transitions. [2025-03-08 21:36:11,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 117 transitions, 389 flow [2025-03-08 21:36:11,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:11,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2025-03-08 21:36:11,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8289085545722714 [2025-03-08 21:36:11,139 INFO L175 Difference]: Start difference. First operand has 97 places, 105 transitions, 274 flow. Second operand 3 states and 281 transitions. [2025-03-08 21:36:11,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 117 transitions, 389 flow [2025-03-08 21:36:11,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 117 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:11,145 INFO L231 Difference]: Finished difference. Result has 99 places, 108 transitions, 310 flow [2025-03-08 21:36:11,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=99, PETRI_TRANSITIONS=108} [2025-03-08 21:36:11,145 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 4 predicate places. [2025-03-08 21:36:11,145 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 108 transitions, 310 flow [2025-03-08 21:36:11,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:11,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:11,146 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] [2025-03-08 21:36:11,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:36:11,146 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:36:11,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:11,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1806980167, now seen corresponding path program 1 times [2025-03-08 21:36:11,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:11,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491921072] [2025-03-08 21:36:11,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:11,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:11,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 21:36:11,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 21:36:11,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:11,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:11,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:11,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491921072] [2025-03-08 21:36:11,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491921072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:11,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:11,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:36:11,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121744216] [2025-03-08 21:36:11,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:11,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:11,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:11,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:11,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:11,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 113 [2025-03-08 21:36:11,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 108 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:11,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:11,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 113 [2025-03-08 21:36:11,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:11,390 INFO L124 PetriNetUnfolderBase]: 298/1093 cut-off events. [2025-03-08 21:36:11,391 INFO L125 PetriNetUnfolderBase]: For 243/246 co-relation queries the response was YES. [2025-03-08 21:36:11,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1975 conditions, 1093 events. 298/1093 cut-off events. For 243/246 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7441 event pairs, 89 based on Foata normal form. 8/982 useless extension candidates. Maximal degree in co-relation 1968. Up to 325 conditions per place. [2025-03-08 21:36:11,394 INFO L140 encePairwiseOnDemand]: 103/113 looper letters, 32 selfloop transitions, 5 changer transitions 1/119 dead transitions. [2025-03-08 21:36:11,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 119 transitions, 410 flow [2025-03-08 21:36:11,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:11,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:11,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2025-03-08 21:36:11,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8259587020648967 [2025-03-08 21:36:11,396 INFO L175 Difference]: Start difference. First operand has 99 places, 108 transitions, 310 flow. Second operand 3 states and 280 transitions. [2025-03-08 21:36:11,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 119 transitions, 410 flow [2025-03-08 21:36:11,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 119 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:11,399 INFO L231 Difference]: Finished difference. Result has 101 places, 112 transitions, 342 flow [2025-03-08 21:36:11,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=101, PETRI_TRANSITIONS=112} [2025-03-08 21:36:11,400 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 6 predicate places. [2025-03-08 21:36:11,400 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 112 transitions, 342 flow [2025-03-08 21:36:11,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:11,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:11,400 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] [2025-03-08 21:36:11,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:36:11,401 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:36:11,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:11,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1595015279, now seen corresponding path program 2 times [2025-03-08 21:36:11,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:11,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95806922] [2025-03-08 21:36:11,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:36:11,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:11,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 1 equivalence classes. [2025-03-08 21:36:11,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 21:36:11,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:36:11,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:11,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:11,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95806922] [2025-03-08 21:36:11,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95806922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:11,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:11,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:36:11,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598944092] [2025-03-08 21:36:11,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:11,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:11,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:11,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:11,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:11,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 113 [2025-03-08 21:36:11,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 112 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:11,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:11,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 113 [2025-03-08 21:36:11,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:11,595 INFO L124 PetriNetUnfolderBase]: 434/1691 cut-off events. [2025-03-08 21:36:11,596 INFO L125 PetriNetUnfolderBase]: For 576/648 co-relation queries the response was YES. [2025-03-08 21:36:11,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3246 conditions, 1691 events. 434/1691 cut-off events. For 576/648 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 13934 event pairs, 77 based on Foata normal form. 18/1503 useless extension candidates. Maximal degree in co-relation 3238. Up to 282 conditions per place. [2025-03-08 21:36:11,602 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 39 selfloop transitions, 3 changer transitions 0/130 dead transitions. [2025-03-08 21:36:11,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 130 transitions, 485 flow [2025-03-08 21:36:11,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2025-03-08 21:36:11,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8643067846607669 [2025-03-08 21:36:11,604 INFO L175 Difference]: Start difference. First operand has 101 places, 112 transitions, 342 flow. Second operand 3 states and 293 transitions. [2025-03-08 21:36:11,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 130 transitions, 485 flow [2025-03-08 21:36:11,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 130 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:11,607 INFO L231 Difference]: Finished difference. Result has 103 places, 115 transitions, 360 flow [2025-03-08 21:36:11,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=103, PETRI_TRANSITIONS=115} [2025-03-08 21:36:11,608 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 8 predicate places. [2025-03-08 21:36:11,608 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 115 transitions, 360 flow [2025-03-08 21:36:11,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:11,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:11,609 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] [2025-03-08 21:36:11,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:36:11,609 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:36:11,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:11,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1618519787, now seen corresponding path program 3 times [2025-03-08 21:36:11,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:11,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954502785] [2025-03-08 21:36:11,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:36:11,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:11,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 1 equivalence classes. [2025-03-08 21:36:11,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 21:36:11,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 21:36:11,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:11,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:11,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954502785] [2025-03-08 21:36:11,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954502785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:11,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:11,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:36:11,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839109674] [2025-03-08 21:36:11,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:11,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:11,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:11,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:11,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:11,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 113 [2025-03-08 21:36:11,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 115 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:11,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:11,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 113 [2025-03-08 21:36:11,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:11,827 INFO L124 PetriNetUnfolderBase]: 433/1822 cut-off events. [2025-03-08 21:36:11,827 INFO L125 PetriNetUnfolderBase]: For 593/644 co-relation queries the response was YES. [2025-03-08 21:36:11,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3588 conditions, 1822 events. 433/1822 cut-off events. For 593/644 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 15503 event pairs, 132 based on Foata normal form. 35/1685 useless extension candidates. Maximal degree in co-relation 3579. Up to 508 conditions per place. [2025-03-08 21:36:11,835 INFO L140 encePairwiseOnDemand]: 103/113 looper letters, 32 selfloop transitions, 5 changer transitions 8/127 dead transitions. [2025-03-08 21:36:11,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 127 transitions, 489 flow [2025-03-08 21:36:11,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2025-03-08 21:36:11,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8259587020648967 [2025-03-08 21:36:11,836 INFO L175 Difference]: Start difference. First operand has 103 places, 115 transitions, 360 flow. Second operand 3 states and 280 transitions. [2025-03-08 21:36:11,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 127 transitions, 489 flow [2025-03-08 21:36:11,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 127 transitions, 481 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:11,839 INFO L231 Difference]: Finished difference. Result has 105 places, 113 transitions, 378 flow [2025-03-08 21:36:11,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=378, PETRI_PLACES=105, PETRI_TRANSITIONS=113} [2025-03-08 21:36:11,840 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 10 predicate places. [2025-03-08 21:36:11,840 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 113 transitions, 378 flow [2025-03-08 21:36:11,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:11,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:11,841 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] [2025-03-08 21:36:11,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:36:11,841 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:36:11,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:11,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2007958135, now seen corresponding path program 4 times [2025-03-08 21:36:11,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:11,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105424423] [2025-03-08 21:36:11,841 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 21:36:11,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:11,848 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-08 21:36:11,854 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-03-08 21:36:11,854 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 21:36:11,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:11,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:11,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105424423] [2025-03-08 21:36:11,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105424423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:11,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:11,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:36:11,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320484433] [2025-03-08 21:36:11,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:11,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:11,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:11,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:11,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:11,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 113 [2025-03-08 21:36:11,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 113 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:11,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:11,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 113 [2025-03-08 21:36:11,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:12,027 INFO L124 PetriNetUnfolderBase]: 321/1609 cut-off events. [2025-03-08 21:36:12,028 INFO L125 PetriNetUnfolderBase]: For 863/953 co-relation queries the response was YES. [2025-03-08 21:36:12,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3306 conditions, 1609 events. 321/1609 cut-off events. For 863/953 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 13961 event pairs, 78 based on Foata normal form. 31/1487 useless extension candidates. Maximal degree in co-relation 3296. Up to 234 conditions per place. [2025-03-08 21:36:12,034 INFO L140 encePairwiseOnDemand]: 109/113 looper letters, 42 selfloop transitions, 3 changer transitions 4/130 dead transitions. [2025-03-08 21:36:12,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 130 transitions, 545 flow [2025-03-08 21:36:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:12,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:12,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2025-03-08 21:36:12,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8613569321533924 [2025-03-08 21:36:12,036 INFO L175 Difference]: Start difference. First operand has 105 places, 113 transitions, 378 flow. Second operand 3 states and 292 transitions. [2025-03-08 21:36:12,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 130 transitions, 545 flow [2025-03-08 21:36:12,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 130 transitions, 525 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:12,041 INFO L231 Difference]: Finished difference. Result has 107 places, 110 transitions, 378 flow [2025-03-08 21:36:12,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=378, PETRI_PLACES=107, PETRI_TRANSITIONS=110} [2025-03-08 21:36:12,042 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 12 predicate places. [2025-03-08 21:36:12,042 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 110 transitions, 378 flow [2025-03-08 21:36:12,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:12,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:12,044 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-03-08 21:36:12,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:36:12,044 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:36:12,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:12,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1220764348, now seen corresponding path program 1 times [2025-03-08 21:36:12,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:12,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840531770] [2025-03-08 21:36:12,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:12,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:12,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 21:36:12,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 21:36:12,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:12,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:12,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:12,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840531770] [2025-03-08 21:36:12,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840531770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:12,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:12,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:36:12,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828550630] [2025-03-08 21:36:12,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:12,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:12,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:12,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:12,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:12,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2025-03-08 21:36:12,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 110 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:12,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:12,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2025-03-08 21:36:12,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:12,194 INFO L124 PetriNetUnfolderBase]: 236/1153 cut-off events. [2025-03-08 21:36:12,194 INFO L125 PetriNetUnfolderBase]: For 523/562 co-relation queries the response was YES. [2025-03-08 21:36:12,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2362 conditions, 1153 events. 236/1153 cut-off events. For 523/562 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8753 event pairs, 42 based on Foata normal form. 7/1067 useless extension candidates. Maximal degree in co-relation 2351. Up to 197 conditions per place. [2025-03-08 21:36:12,198 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 33 selfloop transitions, 4 changer transitions 8/125 dead transitions. [2025-03-08 21:36:12,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 125 transitions, 529 flow [2025-03-08 21:36:12,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2025-03-08 21:36:12,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8584070796460177 [2025-03-08 21:36:12,199 INFO L175 Difference]: Start difference. First operand has 107 places, 110 transitions, 378 flow. Second operand 3 states and 291 transitions. [2025-03-08 21:36:12,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 125 transitions, 529 flow [2025-03-08 21:36:12,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 125 transitions, 509 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:12,203 INFO L231 Difference]: Finished difference. Result has 106 places, 106 transitions, 368 flow [2025-03-08 21:36:12,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=106, PETRI_TRANSITIONS=106} [2025-03-08 21:36:12,203 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 11 predicate places. [2025-03-08 21:36:12,203 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 106 transitions, 368 flow [2025-03-08 21:36:12,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:12,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:12,204 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-03-08 21:36:12,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:36:12,204 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:36:12,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:12,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1879110519, now seen corresponding path program 1 times [2025-03-08 21:36:12,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:12,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932773907] [2025-03-08 21:36:12,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:12,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:12,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 21:36:12,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 21:36:12,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:12,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:12,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:12,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932773907] [2025-03-08 21:36:12,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932773907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:12,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:12,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:36:12,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482736402] [2025-03-08 21:36:12,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:12,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:12,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:12,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:12,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:12,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2025-03-08 21:36:12,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 106 transitions, 368 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:12,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:12,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2025-03-08 21:36:12,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:12,305 INFO L124 PetriNetUnfolderBase]: 160/756 cut-off events. [2025-03-08 21:36:12,305 INFO L125 PetriNetUnfolderBase]: For 400/423 co-relation queries the response was YES. [2025-03-08 21:36:12,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 756 events. 160/756 cut-off events. For 400/423 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4781 event pairs, 38 based on Foata normal form. 8/720 useless extension candidates. Maximal degree in co-relation 1646. Up to 162 conditions per place. [2025-03-08 21:36:12,308 INFO L140 encePairwiseOnDemand]: 109/113 looper letters, 0 selfloop transitions, 0 changer transitions 105/105 dead transitions. [2025-03-08 21:36:12,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 105 transitions, 440 flow [2025-03-08 21:36:12,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2025-03-08 21:36:12,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8495575221238938 [2025-03-08 21:36:12,310 INFO L175 Difference]: Start difference. First operand has 106 places, 106 transitions, 368 flow. Second operand 3 states and 288 transitions. [2025-03-08 21:36:12,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 105 transitions, 440 flow [2025-03-08 21:36:12,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 105 transitions, 402 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-03-08 21:36:12,312 INFO L231 Difference]: Finished difference. Result has 96 places, 0 transitions, 0 flow [2025-03-08 21:36:12,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=96, PETRI_TRANSITIONS=0} [2025-03-08 21:36:12,313 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 1 predicate places. [2025-03-08 21:36:12,313 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 0 transitions, 0 flow [2025-03-08 21:36:12,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:12,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err1ASSERT_VIOLATIONDATA_RACE (9 of 10 remaining) [2025-03-08 21:36:12,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-08 21:36:12,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-08 21:36:12,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-08 21:36:12,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 10 remaining) [2025-03-08 21:36:12,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 10 remaining) [2025-03-08 21:36:12,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-08 21:36:12,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-08 21:36:12,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-08 21:36:12,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-08 21:36:12,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:36:12,317 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2025-03-08 21:36:12,320 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 21:36:12,320 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:36:12,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:36:12 BasicIcfg [2025-03-08 21:36:12,327 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:36:12,328 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:36:12,328 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:36:12,328 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:36:12,328 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:36:09" (3/4) ... [2025-03-08 21:36:12,329 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 21:36:12,333 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thr2 [2025-03-08 21:36:12,333 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thr1 [2025-03-08 21:36:12,335 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 21:36:12,335 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 21:36:12,335 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 21:36:12,335 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 21:36:12,382 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:36:12,382 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:36:12,382 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:36:12,383 INFO L158 Benchmark]: Toolchain (without parser) took 3121.33ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 51.8MB in the end (delta: 60.0MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. [2025-03-08 21:36:12,383 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:36:12,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.22ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 92.2MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 21:36:12,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.04ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:36:12,383 INFO L158 Benchmark]: Boogie Preprocessor took 14.53ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 89.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:36:12,383 INFO L158 Benchmark]: IcfgBuilder took 321.99ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 74.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 21:36:12,384 INFO L158 Benchmark]: TraceAbstraction took 2353.04ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 57.5MB in the end (delta: 16.0MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2025-03-08 21:36:12,384 INFO L158 Benchmark]: Witness Printer took 54.59ms. Allocated memory is still 142.6MB. Free memory was 57.5MB in the beginning and 51.8MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:36:12,385 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.15ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.22ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 92.2MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.04ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.53ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 89.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 321.99ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 74.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2353.04ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 57.5MB in the end (delta: 16.0MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * Witness Printer took 54.59ms. Allocated memory is still 142.6MB. Free memory was 57.5MB in the beginning and 51.8MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 780]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 781]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 754]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 755]: 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, 160 locations, 195 edges, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 523 IncrementalHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 45 mSDtfsCounter, 523 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=378occurred in iteration=7, InterpolantAutomatonStates: 29, 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, 391 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 381 ConstructedInterpolants, 0 QuantifiedInterpolants, 473 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 21:36:12,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE