/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:37:46,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:37:46,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:37:46,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:37:46,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:37:46,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:37:46,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:37:46,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:37:46,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:37:46,379 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:37:46,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:37:46,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:37:46,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:37:46,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:37:46,379 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:37:46,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:37:46,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:37:46,379 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:37:46,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:37:46,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:37:46,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:37:46,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:37:46,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:37:46,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:37:46,380 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:37:46,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:37:46,380 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:37:46,380 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:37:46,380 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:37:46,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:37:46,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:37:46,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:37:46,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:46,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:37:46,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:37:46,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:37:46,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:37:46,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:46,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:37:46,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:37:46,380 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:37:46,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:37:46,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:37:46,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:37:46,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:37:46,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:37:46,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:37:46,381 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:37:46,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:37:46,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:37:46,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:37:46,606 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:37:46,607 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:37:46,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_tso.i [2025-04-13 19:37:47,910 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bacb7635/98233725cc6c4d2aa8a33b2c4a72649f/FLAG19a67ec7a [2025-04-13 19:37:48,127 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:37:48,128 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_tso.i [2025-04-13 19:37:48,136 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bacb7635/98233725cc6c4d2aa8a33b2c4a72649f/FLAG19a67ec7a [2025-04-13 19:37:48,912 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bacb7635/98233725cc6c4d2aa8a33b2c4a72649f [2025-04-13 19:37:48,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:37:48,915 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:37:48,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:37:48,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:37:48,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:37:48,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:37:48" (1/1) ... [2025-04-13 19:37:48,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cc867ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:48, skipping insertion in model container [2025-04-13 19:37:48,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:37:48" (1/1) ... [2025-04-13 19:37:48,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:37:49,102 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_tso.i[945,958] [2025-04-13 19:37:49,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:37:49,221 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:37:49,242 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_tso.i[945,958] [2025-04-13 19:37:49,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:37:49,289 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:37:49,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:49 WrapperNode [2025-04-13 19:37:49,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:37:49,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:37:49,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:37:49,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:37:49,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:49" (1/1) ... [2025-04-13 19:37:49,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:49" (1/1) ... [2025-04-13 19:37:49,315 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-04-13 19:37:49,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:37:49,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:37:49,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:37:49,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:37:49,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:49" (1/1) ... [2025-04-13 19:37:49,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:49" (1/1) ... [2025-04-13 19:37:49,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:49" (1/1) ... [2025-04-13 19:37:49,335 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 19:37:49,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:49" (1/1) ... [2025-04-13 19:37:49,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:49" (1/1) ... [2025-04-13 19:37:49,343 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:49" (1/1) ... [2025-04-13 19:37:49,346 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:49" (1/1) ... [2025-04-13 19:37:49,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:49" (1/1) ... [2025-04-13 19:37:49,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:49" (1/1) ... [2025-04-13 19:37:49,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:49" (1/1) ... [2025-04-13 19:37:49,351 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:37:49,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:37:49,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:37:49,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:37:49,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:49" (1/1) ... [2025-04-13 19:37:49,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:49,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:37:49,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 19:37:49,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 19:37:49,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:37:49,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:37:49,395 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 19:37:49,395 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 19:37:49,395 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 19:37:49,395 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 19:37:49,395 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 19:37:49,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 19:37:49,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:37:49,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:37:49,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:37:49,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:37:49,396 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:37:49,471 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:37:49,472 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:37:49,576 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:37:49,576 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:37:49,576 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:37:49,653 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:37:49,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:37:49 BoogieIcfgContainer [2025-04-13 19:37:49,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:37:49,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:37:49,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:37:49,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:37:49,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:37:48" (1/3) ... [2025-04-13 19:37:49,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c8f6a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:37:49, skipping insertion in model container [2025-04-13 19:37:49,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:49" (2/3) ... [2025-04-13 19:37:49,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c8f6a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:37:49, skipping insertion in model container [2025-04-13 19:37:49,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:37:49" (3/3) ... [2025-04-13 19:37:49,660 INFO L128 eAbstractionObserver]: Analyzing ICFG safe034_tso.i [2025-04-13 19:37:49,670 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:37:49,671 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe034_tso.i that has 4 procedures, 37 locations, 33 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 19:37:49,671 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:37:49,707 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:37:49,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 36 transitions, 84 flow [2025-04-13 19:37:49,749 INFO L116 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-04-13 19:37:49,751 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:37:49,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-13 19:37:49,752 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 36 transitions, 84 flow [2025-04-13 19:37:49,754 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2025-04-13 19:37:49,764 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:37:49,771 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@571ee4cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:37:49,771 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:37:49,778 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:37:49,778 INFO L116 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-04-13 19:37:49,778 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:37:49,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:49,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:49,779 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:37:49,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:49,782 INFO L85 PathProgramCache]: Analyzing trace with hash 34648405, now seen corresponding path program 1 times [2025-04-13 19:37:49,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:49,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112157300] [2025-04-13 19:37:49,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:49,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:49,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:37:49,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:37:49,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:49,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:50,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:50,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:50,221 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112157300] [2025-04-13 19:37:50,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112157300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:50,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:50,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:37:50,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385022409] [2025-04-13 19:37:50,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:50,226 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:37:50,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:50,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:37:50,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:37:50,254 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 36 [2025-04-13 19:37:50,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:50,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:50,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 36 [2025-04-13 19:37:50,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:50,486 INFO L116 PetriNetUnfolderBase]: 608/1267 cut-off events. [2025-04-13 19:37:50,486 INFO L117 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-04-13 19:37:50,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2289 conditions, 1267 events. 608/1267 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8583 event pairs, 194 based on Foata normal form. 58/1307 useless extension candidates. Maximal degree in co-relation 2278. Up to 579 conditions per place. [2025-04-13 19:37:50,500 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 26 selfloop transitions, 5 changer transitions 15/61 dead transitions. [2025-04-13 19:37:50,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 229 flow [2025-04-13 19:37:50,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:37:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:37:50,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2025-04-13 19:37:50,512 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2025-04-13 19:37:50,513 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 5 states and 138 transitions. [2025-04-13 19:37:50,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 229 flow [2025-04-13 19:37:50,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 61 transitions, 224 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 19:37:50,518 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 120 flow [2025-04-13 19:37:50,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2025-04-13 19:37:50,522 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2025-04-13 19:37:50,522 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 120 flow [2025-04-13 19:37:50,523 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:50,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:50,523 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:50,523 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:37:50,523 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:37:50,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:50,524 INFO L85 PathProgramCache]: Analyzing trace with hash -439845930, now seen corresponding path program 1 times [2025-04-13 19:37:50,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:50,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751493397] [2025-04-13 19:37:50,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:50,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:50,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:37:50,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:37:50,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:50,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:50,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:50,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:50,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751493397] [2025-04-13 19:37:50,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751493397] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:50,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:50,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:50,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883346746] [2025-04-13 19:37:50,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:50,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:37:50,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:50,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:37:50,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:37:50,695 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 36 [2025-04-13 19:37:50,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:50,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:50,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 36 [2025-04-13 19:37:50,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:50,848 INFO L116 PetriNetUnfolderBase]: 893/1660 cut-off events. [2025-04-13 19:37:50,848 INFO L117 PetriNetUnfolderBase]: For 391/397 co-relation queries the response was YES. [2025-04-13 19:37:50,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3560 conditions, 1660 events. 893/1660 cut-off events. For 391/397 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 10727 event pairs, 235 based on Foata normal form. 87/1618 useless extension candidates. Maximal degree in co-relation 3546. Up to 777 conditions per place. [2025-04-13 19:37:50,861 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 26 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2025-04-13 19:37:50,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 216 flow [2025-04-13 19:37:50,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:37:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:37:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-04-13 19:37:50,863 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2025-04-13 19:37:50,863 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 120 flow. Second operand 4 states and 109 transitions. [2025-04-13 19:37:50,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 216 flow [2025-04-13 19:37:50,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 204 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 19:37:50,868 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 146 flow [2025-04-13 19:37:50,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-04-13 19:37:50,869 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2025-04-13 19:37:50,869 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 146 flow [2025-04-13 19:37:50,869 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:50,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:50,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:50,869 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:37:50,870 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:37:50,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:50,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1286266354, now seen corresponding path program 1 times [2025-04-13 19:37:50,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:50,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20323930] [2025-04-13 19:37:50,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:50,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:50,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 19:37:50,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 19:37:50,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:50,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:50,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:50,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20323930] [2025-04-13 19:37:50,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20323930] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:50,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:50,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:37:50,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930499691] [2025-04-13 19:37:50,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:50,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:50,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:50,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:50,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:50,983 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 36 [2025-04-13 19:37:50,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:50,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:50,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 36 [2025-04-13 19:37:50,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:51,135 INFO L116 PetriNetUnfolderBase]: 708/1378 cut-off events. [2025-04-13 19:37:51,135 INFO L117 PetriNetUnfolderBase]: For 640/1237 co-relation queries the response was YES. [2025-04-13 19:37:51,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3504 conditions, 1378 events. 708/1378 cut-off events. For 640/1237 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8770 event pairs, 64 based on Foata normal form. 100/1389 useless extension candidates. Maximal degree in co-relation 3488. Up to 592 conditions per place. [2025-04-13 19:37:51,144 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 33 selfloop transitions, 8 changer transitions 0/61 dead transitions. [2025-04-13 19:37:51,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 291 flow [2025-04-13 19:37:51,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:37:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:37:51,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2025-04-13 19:37:51,145 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2025-04-13 19:37:51,145 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 146 flow. Second operand 5 states and 138 transitions. [2025-04-13 19:37:51,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 291 flow [2025-04-13 19:37:51,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 286 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 19:37:51,147 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 196 flow [2025-04-13 19:37:51,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2025-04-13 19:37:51,149 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2025-04-13 19:37:51,149 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 196 flow [2025-04-13 19:37:51,150 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:51,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:51,150 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] [2025-04-13 19:37:51,150 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:37:51,150 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:37:51,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:51,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1552006514, now seen corresponding path program 1 times [2025-04-13 19:37:51,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:51,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299517603] [2025-04-13 19:37:51,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:51,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:51,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:37:51,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:37:51,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:51,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:51,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:51,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299517603] [2025-04-13 19:37:51,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299517603] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:51,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:51,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:37:51,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137627680] [2025-04-13 19:37:51,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:51,278 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:37:51,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:51,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:37:51,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:37:51,287 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 36 [2025-04-13 19:37:51,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:51,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:51,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 36 [2025-04-13 19:37:51,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:51,433 INFO L116 PetriNetUnfolderBase]: 560/1082 cut-off events. [2025-04-13 19:37:51,433 INFO L117 PetriNetUnfolderBase]: For 1850/2947 co-relation queries the response was YES. [2025-04-13 19:37:51,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3366 conditions, 1082 events. 560/1082 cut-off events. For 1850/2947 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6355 event pairs, 36 based on Foata normal form. 92/1093 useless extension candidates. Maximal degree in co-relation 3348. Up to 464 conditions per place. [2025-04-13 19:37:51,438 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 30 selfloop transitions, 11 changer transitions 2/63 dead transitions. [2025-04-13 19:37:51,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 63 transitions, 331 flow [2025-04-13 19:37:51,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:37:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:37:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2025-04-13 19:37:51,440 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7361111111111112 [2025-04-13 19:37:51,440 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 196 flow. Second operand 6 states and 159 transitions. [2025-04-13 19:37:51,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 63 transitions, 331 flow [2025-04-13 19:37:51,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 314 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-13 19:37:51,445 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 224 flow [2025-04-13 19:37:51,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2025-04-13 19:37:51,446 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2025-04-13 19:37:51,446 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 224 flow [2025-04-13 19:37:51,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:51,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:51,446 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-04-13 19:37:51,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:37:51,446 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:37:51,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1152448223, now seen corresponding path program 1 times [2025-04-13 19:37:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:51,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055360788] [2025-04-13 19:37:51,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:51,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:37:51,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:37:51,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:51,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:51,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:51,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055360788] [2025-04-13 19:37:51,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055360788] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:51,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:51,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:37:51,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982699608] [2025-04-13 19:37:51,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:51,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:51,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:51,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:51,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:51,600 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 36 [2025-04-13 19:37:51,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:51,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:51,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 36 [2025-04-13 19:37:51,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:51,780 INFO L116 PetriNetUnfolderBase]: 820/1798 cut-off events. [2025-04-13 19:37:51,780 INFO L117 PetriNetUnfolderBase]: For 3047/3283 co-relation queries the response was YES. [2025-04-13 19:37:51,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5025 conditions, 1798 events. 820/1798 cut-off events. For 3047/3283 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 13026 event pairs, 91 based on Foata normal form. 31/1662 useless extension candidates. Maximal degree in co-relation 5005. Up to 551 conditions per place. [2025-04-13 19:37:51,788 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 35 selfloop transitions, 11 changer transitions 7/76 dead transitions. [2025-04-13 19:37:51,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 76 transitions, 432 flow [2025-04-13 19:37:51,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:37:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:37:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2025-04-13 19:37:51,789 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7129629629629629 [2025-04-13 19:37:51,789 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 224 flow. Second operand 6 states and 154 transitions. [2025-04-13 19:37:51,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 76 transitions, 432 flow [2025-04-13 19:37:51,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 400 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-04-13 19:37:51,809 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 269 flow [2025-04-13 19:37:51,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2025-04-13 19:37:51,809 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2025-04-13 19:37:51,809 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 269 flow [2025-04-13 19:37:51,809 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:51,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:51,810 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-04-13 19:37:51,810 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:37:51,810 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:37:51,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:51,810 INFO L85 PathProgramCache]: Analyzing trace with hash -32928125, now seen corresponding path program 2 times [2025-04-13 19:37:51,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:51,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129044626] [2025-04-13 19:37:51,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:37:51,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:51,817 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:37:51,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:37:51,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:37:51,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:51,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:51,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129044626] [2025-04-13 19:37:51,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129044626] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:51,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:51,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:37:51,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231341037] [2025-04-13 19:37:51,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:51,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:51,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:51,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:51,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:51,951 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 36 [2025-04-13 19:37:51,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 269 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:51,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:51,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 36 [2025-04-13 19:37:51,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:52,119 INFO L116 PetriNetUnfolderBase]: 970/2138 cut-off events. [2025-04-13 19:37:52,119 INFO L117 PetriNetUnfolderBase]: For 3528/3760 co-relation queries the response was YES. [2025-04-13 19:37:52,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6179 conditions, 2138 events. 970/2138 cut-off events. For 3528/3760 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 16468 event pairs, 306 based on Foata normal form. 34/1883 useless extension candidates. Maximal degree in co-relation 6156. Up to 704 conditions per place. [2025-04-13 19:37:52,127 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 19 selfloop transitions, 4 changer transitions 23/71 dead transitions. [2025-04-13 19:37:52,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 71 transitions, 454 flow [2025-04-13 19:37:52,128 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:37:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:37:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-04-13 19:37:52,129 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7055555555555556 [2025-04-13 19:37:52,129 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 269 flow. Second operand 5 states and 127 transitions. [2025-04-13 19:37:52,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 71 transitions, 454 flow [2025-04-13 19:37:52,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 71 transitions, 452 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:37:52,137 INFO L231 Difference]: Finished difference. Result has 66 places, 45 transitions, 240 flow [2025-04-13 19:37:52,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=66, PETRI_TRANSITIONS=45} [2025-04-13 19:37:52,139 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2025-04-13 19:37:52,139 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 45 transitions, 240 flow [2025-04-13 19:37:52,139 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:52,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:52,139 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-04-13 19:37:52,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:37:52,140 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:37:52,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:52,140 INFO L85 PathProgramCache]: Analyzing trace with hash 652993393, now seen corresponding path program 3 times [2025-04-13 19:37:52,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:52,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627874241] [2025-04-13 19:37:52,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:37:52,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:52,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:37:52,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:37:52,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:37:52,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:52,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:52,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627874241] [2025-04-13 19:37:52,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627874241] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:52,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:52,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:37:52,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192910994] [2025-04-13 19:37:52,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:52,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:52,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:52,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:52,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:52,268 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 36 [2025-04-13 19:37:52,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 45 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:52,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:52,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 36 [2025-04-13 19:37:52,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:52,350 INFO L116 PetriNetUnfolderBase]: 242/592 cut-off events. [2025-04-13 19:37:52,350 INFO L117 PetriNetUnfolderBase]: For 792/839 co-relation queries the response was YES. [2025-04-13 19:37:52,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1692 conditions, 592 events. 242/592 cut-off events. For 792/839 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3599 event pairs, 34 based on Foata normal form. 16/534 useless extension candidates. Maximal degree in co-relation 1676. Up to 275 conditions per place. [2025-04-13 19:37:52,353 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 0 selfloop transitions, 0 changer transitions 51/51 dead transitions. [2025-04-13 19:37:52,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 51 transitions, 294 flow [2025-04-13 19:37:52,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:37:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:37:52,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-04-13 19:37:52,354 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2025-04-13 19:37:52,354 INFO L175 Difference]: Start difference. First operand has 66 places, 45 transitions, 240 flow. Second operand 5 states and 122 transitions. [2025-04-13 19:37:52,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 51 transitions, 294 flow [2025-04-13 19:37:52,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 51 transitions, 274 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-04-13 19:37:52,356 INFO L231 Difference]: Finished difference. Result has 63 places, 0 transitions, 0 flow [2025-04-13 19:37:52,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=63, PETRI_TRANSITIONS=0} [2025-04-13 19:37:52,356 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2025-04-13 19:37:52,356 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 0 transitions, 0 flow [2025-04-13 19:37:52,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:37:52,358 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 19:37:52,359 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 19:37:52,359 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 19:37:52,359 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 19:37:52,359 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:37:52,359 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2025-04-13 19:37:52,361 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:37:52,361 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:37:52,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:37:52 BasicIcfg [2025-04-13 19:37:52,364 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:37:52,365 INFO L158 Benchmark]: Toolchain (without parser) took 3449.68ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 100.2MB in the beginning and 89.7MB in the end (delta: 10.6MB). Peak memory consumption was 37.4MB. Max. memory is 8.0GB. [2025-04-13 19:37:52,365 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:37:52,365 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.77ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 77.2MB in the end (delta: 23.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 19:37:52,365 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.17ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 75.0MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:37:52,365 INFO L158 Benchmark]: Boogie Preprocessor took 35.73ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 73.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:37:52,365 INFO L158 Benchmark]: RCFGBuilder took 298.20ms. Allocated memory is still 142.6MB. Free memory was 73.4MB in the beginning and 51.7MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 19:37:52,366 INFO L158 Benchmark]: TraceAbstraction took 2709.07ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 51.2MB in the beginning and 89.7MB in the end (delta: -38.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:37:52,366 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.16ms. Allocated memory is still 155.2MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 373.77ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 77.2MB in the end (delta: 23.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.17ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 75.0MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.73ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 73.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 298.20ms. Allocated memory is still 142.6MB. Free memory was 73.4MB in the beginning and 51.7MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2709.07ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 51.2MB in the beginning and 89.7MB in the end (delta: -38.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 63 locations, 59 edges, 4 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.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 218 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 443 IncrementalHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 28 mSDtfsCounter, 443 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=269occurred in iteration=5, InterpolantAutomatonStates: 36, 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, 1.0s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 713 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 19:37:52,380 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...