/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_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-wmm/safe037.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:10:57,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:10:58,010 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-14 00:10:58,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:10:58,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:10:58,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:10:58,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:10:58,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:10:58,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:10:58,028 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:10:58,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:10:58,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:10:58,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:10:58,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:10:58,029 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:10:58,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:10:58,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:10:58,029 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:10:58,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:10:58,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:10:58,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:10:58,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:10:58,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:10:58,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:10:58,030 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:10:58,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:10:58,030 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:10:58,030 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:10:58,030 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:10:58,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:10:58,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:10:58,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:10:58,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:58,030 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:10:58,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:10:58,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:10:58,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:10:58,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:58,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:10:58,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:10:58,031 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:10:58,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:10:58,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:10:58,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:10:58,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:10:58,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:10:58,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:10:58,031 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:10:58,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:10:58,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:10:58,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:10:58,260 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:10:58,260 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:10:58,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe037.i [2025-04-14 00:10:59,591 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d2eab40/2924dcd36bea4dbbb1ee55cefa4b7637/FLAGcf38ef59a [2025-04-14 00:10:59,822 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:10:59,823 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe037.i [2025-04-14 00:10:59,838 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d2eab40/2924dcd36bea4dbbb1ee55cefa4b7637/FLAGcf38ef59a [2025-04-14 00:11:00,592 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d2eab40/2924dcd36bea4dbbb1ee55cefa4b7637 [2025-04-14 00:11:00,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:11:00,597 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:11:00,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:11:00,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:11:00,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:11:00,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:11:00" (1/1) ... [2025-04-14 00:11:00,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e42ed4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:00, skipping insertion in model container [2025-04-14 00:11:00,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:11:00" (1/1) ... [2025-04-14 00:11:00,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:11:00,798 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/safe037.i[941,954] [2025-04-14 00:11:00,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:11:00,964 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:11:00,996 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/safe037.i[941,954] [2025-04-14 00:11:01,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:11:01,067 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:11:01,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:01 WrapperNode [2025-04-14 00:11:01,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:11:01,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:11:01,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:11:01,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:11:01,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:01" (1/1) ... [2025-04-14 00:11:01,089 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:01" (1/1) ... [2025-04-14 00:11:01,104 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2025-04-14 00:11:01,105 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:11:01,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:11:01,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:11:01,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:11:01,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:01" (1/1) ... [2025-04-14 00:11:01,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:01" (1/1) ... [2025-04-14 00:11:01,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:01" (1/1) ... [2025-04-14 00:11:01,123 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-14 00:11:01,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:01" (1/1) ... [2025-04-14 00:11:01,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:01" (1/1) ... [2025-04-14 00:11:01,127 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:01" (1/1) ... [2025-04-14 00:11:01,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:01" (1/1) ... [2025-04-14 00:11:01,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:01" (1/1) ... [2025-04-14 00:11:01,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:01" (1/1) ... [2025-04-14 00:11:01,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:11:01,132 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:11:01,132 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:11:01,132 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:11:01,133 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:01" (1/1) ... [2025-04-14 00:11:01,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:11:01,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:11:01,156 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-14 00:11:01,158 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-14 00:11:01,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:11:01,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:11:01,177 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-14 00:11:01,177 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-14 00:11:01,177 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-14 00:11:01,177 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-14 00:11:01,177 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-14 00:11:01,177 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-14 00:11:01,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:11:01,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:11:01,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:11:01,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:11:01,178 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:11:01,294 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:11:01,296 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:11:01,428 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:11:01,428 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:11:01,428 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:11:01,529 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:11:01,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:11:01 BoogieIcfgContainer [2025-04-14 00:11:01,529 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:11:01,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:11:01,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:11:01,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:11:01,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:11:00" (1/3) ... [2025-04-14 00:11:01,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa10812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:11:01, skipping insertion in model container [2025-04-14 00:11:01,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:01" (2/3) ... [2025-04-14 00:11:01,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa10812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:11:01, skipping insertion in model container [2025-04-14 00:11:01,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:11:01" (3/3) ... [2025-04-14 00:11:01,538 INFO L128 eAbstractionObserver]: Analyzing ICFG safe037.i [2025-04-14 00:11:01,548 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:11:01,550 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe037.i that has 4 procedures, 38 locations, 34 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-14 00:11:01,550 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:11:01,594 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:11:01,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 86 flow [2025-04-14 00:11:01,650 INFO L116 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-04-14 00:11:01,654 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:11:01,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-14 00:11:01,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 37 transitions, 86 flow [2025-04-14 00:11:01,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2025-04-14 00:11:01,668 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:11:01,684 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;@1f1b188c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:11:01,684 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:11:01,695 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:11:01,695 INFO L116 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-04-14 00:11:01,695 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:11:01,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:01,698 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:01,698 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-14 00:11:01,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:01,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1297002648, now seen corresponding path program 1 times [2025-04-14 00:11:01,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:01,710 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705355753] [2025-04-14 00:11:01,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:01,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:01,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:11:01,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:11:01,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:01,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:02,126 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-14 00:11:02,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:02,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705355753] [2025-04-14 00:11:02,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705355753] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:02,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:02,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:11:02,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908359335] [2025-04-14 00:11:02,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:02,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:11:02,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:02,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:11:02,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:11:02,155 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:11:02,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-14 00:11:02,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:02,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:11:02,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:02,725 INFO L116 PetriNetUnfolderBase]: 4801/7044 cut-off events. [2025-04-14 00:11:02,725 INFO L117 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-04-14 00:11:02,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14196 conditions, 7044 events. 4801/7044 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 37507 event pairs, 994 based on Foata normal form. 343/7372 useless extension candidates. Maximal degree in co-relation 14185. Up to 3626 conditions per place. [2025-04-14 00:11:02,770 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 63 selfloop transitions, 5 changer transitions 1/72 dead transitions. [2025-04-14 00:11:02,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 72 transitions, 297 flow [2025-04-14 00:11:02,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:11:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:11:02,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-04-14 00:11:02,779 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6418918918918919 [2025-04-14 00:11:02,780 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 4 states and 95 transitions. [2025-04-14 00:11:02,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 72 transitions, 297 flow [2025-04-14 00:11:02,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 72 transitions, 292 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:11:02,787 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 106 flow [2025-04-14 00:11:02,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2025-04-14 00:11:02,792 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2025-04-14 00:11:02,792 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 106 flow [2025-04-14 00:11:02,793 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-14 00:11:02,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:02,793 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-14 00:11:02,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:11:02,793 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-14 00:11:02,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:02,794 INFO L85 PathProgramCache]: Analyzing trace with hash -181917099, now seen corresponding path program 1 times [2025-04-14 00:11:02,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:02,794 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711595720] [2025-04-14 00:11:02,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:02,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:02,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:11:02,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:11:02,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:02,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:02,957 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-14 00:11:02,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:02,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711595720] [2025-04-14 00:11:02,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711595720] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:02,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:02,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:11:02,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034189599] [2025-04-14 00:11:02,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:02,959 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:11:02,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:02,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:11:02,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:11:02,959 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:11:02,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-14 00:11:02,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:02,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:11:02,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:03,365 INFO L116 PetriNetUnfolderBase]: 2701/4069 cut-off events. [2025-04-14 00:11:03,365 INFO L117 PetriNetUnfolderBase]: For 805/805 co-relation queries the response was YES. [2025-04-14 00:11:03,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9447 conditions, 4069 events. 2701/4069 cut-off events. For 805/805 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 19877 event pairs, 651 based on Foata normal form. 218/4272 useless extension candidates. Maximal degree in co-relation 9435. Up to 1515 conditions per place. [2025-04-14 00:11:03,386 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 81 selfloop transitions, 8 changer transitions 1/93 dead transitions. [2025-04-14 00:11:03,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 93 transitions, 421 flow [2025-04-14 00:11:03,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:11:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:11:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-04-14 00:11:03,389 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6594594594594595 [2025-04-14 00:11:03,389 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 106 flow. Second operand 5 states and 122 transitions. [2025-04-14 00:11:03,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 93 transitions, 421 flow [2025-04-14 00:11:03,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 93 transitions, 411 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 00:11:03,395 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 146 flow [2025-04-14 00:11:03,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2025-04-14 00:11:03,395 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2025-04-14 00:11:03,396 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 146 flow [2025-04-14 00:11:03,396 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-14 00:11:03,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:03,396 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] [2025-04-14 00:11:03,396 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:11:03,396 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-14 00:11:03,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:03,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1538368022, now seen corresponding path program 1 times [2025-04-14 00:11:03,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:03,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551937393] [2025-04-14 00:11:03,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:03,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:03,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:11:03,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:11:03,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:03,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:03,557 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-14 00:11:03,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:03,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551937393] [2025-04-14 00:11:03,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551937393] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:03,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:03,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:11:03,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716367836] [2025-04-14 00:11:03,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:03,558 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:11:03,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:03,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:11:03,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:11:03,558 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:11:03,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-14 00:11:03,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:03,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:11:03,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:03,848 INFO L116 PetriNetUnfolderBase]: 1786/2704 cut-off events. [2025-04-14 00:11:03,848 INFO L117 PetriNetUnfolderBase]: For 1522/1522 co-relation queries the response was YES. [2025-04-14 00:11:03,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6651 conditions, 2704 events. 1786/2704 cut-off events. For 1522/1522 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12476 event pairs, 594 based on Foata normal form. 68/2757 useless extension candidates. Maximal degree in co-relation 6637. Up to 1050 conditions per place. [2025-04-14 00:11:03,863 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 67 selfloop transitions, 11 changer transitions 1/82 dead transitions. [2025-04-14 00:11:03,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 82 transitions, 400 flow [2025-04-14 00:11:03,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:11:03,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:11:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2025-04-14 00:11:03,865 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2025-04-14 00:11:03,865 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 146 flow. Second operand 6 states and 117 transitions. [2025-04-14 00:11:03,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 82 transitions, 400 flow [2025-04-14 00:11:03,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 82 transitions, 375 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-14 00:11:03,878 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 160 flow [2025-04-14 00:11:03,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2025-04-14 00:11:03,878 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2025-04-14 00:11:03,878 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 160 flow [2025-04-14 00:11:03,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-14 00:11:03,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:03,879 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] [2025-04-14 00:11:03,879 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:11:03,879 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-14 00:11:03,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:03,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1096575255, now seen corresponding path program 1 times [2025-04-14 00:11:03,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:03,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014977380] [2025-04-14 00:11:03,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:03,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:03,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-14 00:11:03,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 00:11:03,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:03,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:04,049 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-14 00:11:04,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:04,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014977380] [2025-04-14 00:11:04,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014977380] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:04,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:04,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:11:04,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465238379] [2025-04-14 00:11:04,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:04,050 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:11:04,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:04,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:11:04,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:11:04,051 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:11:04,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-14 00:11:04,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:04,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:11:04,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:04,400 INFO L116 PetriNetUnfolderBase]: 2362/3580 cut-off events. [2025-04-14 00:11:04,401 INFO L117 PetriNetUnfolderBase]: For 2352/2352 co-relation queries the response was YES. [2025-04-14 00:11:04,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8952 conditions, 3580 events. 2362/3580 cut-off events. For 2352/2352 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 17087 event pairs, 324 based on Foata normal form. 8/3573 useless extension candidates. Maximal degree in co-relation 8937. Up to 1906 conditions per place. [2025-04-14 00:11:04,413 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 47 selfloop transitions, 1 changer transitions 31/82 dead transitions. [2025-04-14 00:11:04,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 82 transitions, 500 flow [2025-04-14 00:11:04,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:11:04,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:11:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-04-14 00:11:04,415 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.518918918918919 [2025-04-14 00:11:04,416 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 160 flow. Second operand 5 states and 96 transitions. [2025-04-14 00:11:04,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 82 transitions, 500 flow [2025-04-14 00:11:04,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 82 transitions, 375 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-04-14 00:11:04,428 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 113 flow [2025-04-14 00:11:04,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2025-04-14 00:11:04,429 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2025-04-14 00:11:04,429 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 113 flow [2025-04-14 00:11:04,429 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-14 00:11:04,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:04,430 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] [2025-04-14 00:11:04,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:11:04,430 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-14 00:11:04,430 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1845073385, now seen corresponding path program 2 times [2025-04-14 00:11:04,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:04,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519364039] [2025-04-14 00:11:04,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:11:04,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:04,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-04-14 00:11:04,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 00:11:04,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:11:04,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:04,564 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-14 00:11:04,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:04,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519364039] [2025-04-14 00:11:04,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519364039] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:04,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:04,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:11:04,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878651937] [2025-04-14 00:11:04,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:04,565 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:11:04,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:04,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:11:04,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:11:04,565 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:11:04,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-14 00:11:04,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:04,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:11:04,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:04,817 INFO L116 PetriNetUnfolderBase]: 2230/3441 cut-off events. [2025-04-14 00:11:04,817 INFO L117 PetriNetUnfolderBase]: For 559/559 co-relation queries the response was YES. [2025-04-14 00:11:04,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7661 conditions, 3441 events. 2230/3441 cut-off events. For 559/559 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 17610 event pairs, 260 based on Foata normal form. 8/3446 useless extension candidates. Maximal degree in co-relation 7648. Up to 2154 conditions per place. [2025-04-14 00:11:04,832 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 63 selfloop transitions, 3 changer transitions 16/85 dead transitions. [2025-04-14 00:11:04,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 85 transitions, 407 flow [2025-04-14 00:11:04,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:11:04,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:11:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2025-04-14 00:11:04,840 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5351351351351351 [2025-04-14 00:11:04,840 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 113 flow. Second operand 5 states and 99 transitions. [2025-04-14 00:11:04,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 85 transitions, 407 flow [2025-04-14 00:11:04,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 85 transitions, 399 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-14 00:11:04,842 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 131 flow [2025-04-14 00:11:04,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2025-04-14 00:11:04,844 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2025-04-14 00:11:04,844 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 131 flow [2025-04-14 00:11:04,844 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-14 00:11:04,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:04,845 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:04,845 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:11:04,845 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-14 00:11:04,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:04,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1388056569, now seen corresponding path program 3 times [2025-04-14 00:11:04,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:04,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186484637] [2025-04-14 00:11:04,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:11:04,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:04,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-04-14 00:11:04,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 00:11:04,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:11:04,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:04,969 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-14 00:11:04,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:04,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186484637] [2025-04-14 00:11:04,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186484637] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:04,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:04,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:11:04,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040147821] [2025-04-14 00:11:04,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:04,970 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:11:04,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:04,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:11:04,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:11:04,970 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:11:04,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-14 00:11:04,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:04,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:11:04,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:05,281 INFO L116 PetriNetUnfolderBase]: 2662/4116 cut-off events. [2025-04-14 00:11:05,281 INFO L117 PetriNetUnfolderBase]: For 1325/1325 co-relation queries the response was YES. [2025-04-14 00:11:05,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9835 conditions, 4116 events. 2662/4116 cut-off events. For 1325/1325 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 21488 event pairs, 548 based on Foata normal form. 8/4118 useless extension candidates. Maximal degree in co-relation 9828. Up to 2514 conditions per place. [2025-04-14 00:11:05,290 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 0 selfloop transitions, 0 changer transitions 88/88 dead transitions. [2025-04-14 00:11:05,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 449 flow [2025-04-14 00:11:05,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:11:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:11:05,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-04-14 00:11:05,292 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5297297297297298 [2025-04-14 00:11:05,292 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 131 flow. Second operand 5 states and 98 transitions. [2025-04-14 00:11:05,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 449 flow [2025-04-14 00:11:05,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:11:05,294 INFO L231 Difference]: Finished difference. Result has 54 places, 0 transitions, 0 flow [2025-04-14 00:11:05,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=54, PETRI_TRANSITIONS=0} [2025-04-14 00:11:05,295 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2025-04-14 00:11:05,295 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 0 transitions, 0 flow [2025-04-14 00:11:05,295 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-14 00:11:05,297 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 00:11:05,298 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 00:11:05,298 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 00:11:05,298 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 00:11:05,298 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:11:05,298 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-04-14 00:11:05,301 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:11:05,301 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:11:05,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:11:05 BasicIcfg [2025-04-14 00:11:05,306 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:11:05,306 INFO L158 Benchmark]: Toolchain (without parser) took 4709.67ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 100.0MB in the beginning and 235.1MB in the end (delta: -135.1MB). Peak memory consumption was 107.5MB. Max. memory is 8.0GB. [2025-04-14 00:11:05,307 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:11:05,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.17ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 76.6MB in the end (delta: 23.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 00:11:05,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.59ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 74.7MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:11:05,307 INFO L158 Benchmark]: Boogie Preprocessor took 25.49ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 73.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:11:05,307 INFO L158 Benchmark]: IcfgBuilder took 397.52ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 49.0MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 00:11:05,308 INFO L158 Benchmark]: TraceAbstraction took 3775.39ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 48.4MB in the beginning and 235.1MB in the end (delta: -186.7MB). Peak memory consumption was 57.1MB. Max. memory is 8.0GB. [2025-04-14 00:11:05,310 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 159.4MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 469.17ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 76.6MB in the end (delta: 23.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.59ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 74.7MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.49ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 73.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 397.52ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 49.0MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 3775.39ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 48.4MB in the beginning and 235.1MB in the end (delta: -186.7MB). Peak memory consumption was 57.1MB. 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, 65 locations, 61 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: 3.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 360 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 360 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 907 IncrementalHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 0 mSDtfsCounter, 907 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=3, InterpolantAutomatonStates: 30, 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, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-14 00:11:05,325 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...