/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/weaver/chl-simpl-str-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:42:18,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:42:18,544 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:42:18,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:42:18,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:42:18,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:42:18,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:42:18,573 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:42:18,573 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:42:18,573 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:42:18,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:42:18,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:42:18,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:42:18,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:42:18,574 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:42:18,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:42:18,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:42:18,574 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:42:18,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:42:18,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:42:18,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:42:18,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:42:18,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:42:18,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:42:18,575 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:42:18,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:42:18,575 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:42:18,575 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:42:18,575 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:42:18,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:42:18,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:42:18,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:42:18,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:42:18,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:42:18,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:42:18,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:42:18,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:42:18,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:42:18,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:42:18,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:42:18,576 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:42:18,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:42:18,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:42:18,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:42:18,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:42:18,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:42:18,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:42:18,576 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:42:18,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:42:18,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:42:18,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:42:18,813 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:42:18,815 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:42:18,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c [2025-04-14 00:42:20,220 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/447213dd1/c1e26019cdd541239ae525962328c64c/FLAG169842b5e [2025-04-14 00:42:20,470 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:42:20,471 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c [2025-04-14 00:42:20,478 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/447213dd1/c1e26019cdd541239ae525962328c64c/FLAG169842b5e [2025-04-14 00:42:21,222 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/447213dd1/c1e26019cdd541239ae525962328c64c [2025-04-14 00:42:21,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:42:21,225 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:42:21,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:42:21,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:42:21,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:42:21,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:42:21" (1/1) ... [2025-04-14 00:42:21,230 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@661af82c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:42:21, skipping insertion in model container [2025-04-14 00:42:21,230 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:42:21" (1/1) ... [2025-04-14 00:42:21,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:42:21,430 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c[2614,2627] [2025-04-14 00:42:21,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:42:21,446 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:42:21,483 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c[2614,2627] [2025-04-14 00:42:21,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:42:21,499 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:42:21,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:42:21 WrapperNode [2025-04-14 00:42:21,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:42:21,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:42:21,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:42:21,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:42:21,507 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:42:21" (1/1) ... [2025-04-14 00:42:21,513 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:42:21" (1/1) ... [2025-04-14 00:42:21,544 INFO L138 Inliner]: procedures = 22, calls = 16, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 157 [2025-04-14 00:42:21,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:42:21,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:42:21,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:42:21,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:42:21,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:42:21" (1/1) ... [2025-04-14 00:42:21,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:42:21" (1/1) ... [2025-04-14 00:42:21,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:42:21" (1/1) ... [2025-04-14 00:42:21,574 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:42:21,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:42:21" (1/1) ... [2025-04-14 00:42:21,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:42:21" (1/1) ... [2025-04-14 00:42:21,583 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:42:21" (1/1) ... [2025-04-14 00:42:21,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:42:21" (1/1) ... [2025-04-14 00:42:21,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:42:21" (1/1) ... [2025-04-14 00:42:21,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:42:21" (1/1) ... [2025-04-14 00:42:21,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:42:21,596 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:42:21,596 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:42:21,596 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:42:21,597 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:42:21" (1/1) ... [2025-04-14 00:42:21,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:42:21,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:42:21,625 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:42:21,627 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:42:21,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:42:21,646 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:42:21,646 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:42:21,646 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:42:21,646 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:42:21,646 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:42:21,646 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:42:21,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:42:21,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:42:21,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:42:21,647 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:42:21,720 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:42:21,722 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:42:21,916 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:42:21,917 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:42:21,917 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:42:22,216 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:42:22,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:42:22 BoogieIcfgContainer [2025-04-14 00:42:22,216 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:42:22,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:42:22,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:42:22,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:42:22,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:42:21" (1/3) ... [2025-04-14 00:42:22,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d02e932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:42:22, skipping insertion in model container [2025-04-14 00:42:22,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:42:21" (2/3) ... [2025-04-14 00:42:22,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d02e932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:42:22, skipping insertion in model container [2025-04-14 00:42:22,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:42:22" (3/3) ... [2025-04-14 00:42:22,224 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-subst.wvr.c [2025-04-14 00:42:22,242 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:42:22,243 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-simpl-str-subst.wvr.c that has 4 procedures, 19 locations, 15 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-14 00:42:22,243 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:42:22,293 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 00:42:22,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 18 transitions, 57 flow [2025-04-14 00:42:22,353 INFO L116 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-04-14 00:42:22,354 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:42:22,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 15 events. 0/15 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-14 00:42:22,357 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 18 transitions, 57 flow [2025-04-14 00:42:22,361 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 14 transitions, 46 flow [2025-04-14 00:42:22,370 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:42:22,380 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;@5e6a9dfa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:42:22,380 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:42:22,387 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:42:22,387 INFO L116 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-04-14 00:42:22,387 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:42:22,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:42:22,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:42:22,388 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:42:22,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:42:22,393 INFO L85 PathProgramCache]: Analyzing trace with hash 674892018, now seen corresponding path program 1 times [2025-04-14 00:42:22,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:42:22,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111997780] [2025-04-14 00:42:22,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:42:22,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:42:22,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:42:22,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:42:22,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:42:22,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:42:23,831 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:42:23,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:42:23,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111997780] [2025-04-14 00:42:23,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111997780] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:42:23,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:42:23,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:42:23,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620259125] [2025-04-14 00:42:23,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:42:23,840 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:42:23,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:42:23,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:42:23,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:42:23,861 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-14 00:42:23,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 14 transitions, 46 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:42:23,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:42:23,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-14 00:42:23,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:42:24,119 INFO L116 PetriNetUnfolderBase]: 32/83 cut-off events. [2025-04-14 00:42:24,120 INFO L117 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-04-14 00:42:24,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 83 events. 32/83 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 225 event pairs, 1 based on Foata normal form. 1/84 useless extension candidates. Maximal degree in co-relation 145. Up to 34 conditions per place. [2025-04-14 00:42:24,122 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 26 selfloop transitions, 6 changer transitions 5/37 dead transitions. [2025-04-14 00:42:24,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 37 transitions, 196 flow [2025-04-14 00:42:24,122 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:42:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:42:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2025-04-14 00:42:24,130 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-04-14 00:42:24,131 INFO L175 Difference]: Start difference. First operand has 24 places, 14 transitions, 46 flow. Second operand 6 states and 56 transitions. [2025-04-14 00:42:24,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 37 transitions, 196 flow [2025-04-14 00:42:24,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 37 transitions, 164 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 00:42:24,137 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 67 flow [2025-04-14 00:42:24,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=67, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2025-04-14 00:42:24,140 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2025-04-14 00:42:24,140 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 67 flow [2025-04-14 00:42:24,141 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:42:24,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:42:24,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:42:24,141 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:42:24,141 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:42:24,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:42:24,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1908098390, now seen corresponding path program 2 times [2025-04-14 00:42:24,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:42:24,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949415272] [2025-04-14 00:42:24,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:42:24,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:42:24,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:42:24,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:42:24,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:42:24,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:42:24,948 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:42:24,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:42:24,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949415272] [2025-04-14 00:42:24,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949415272] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:42:24,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:42:24,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:42:24,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372375534] [2025-04-14 00:42:24,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:42:24,949 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:42:24,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:42:24,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:42:24,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:42:24,950 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-14 00:42:24,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:42:24,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:42:24,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-14 00:42:24,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:42:25,136 INFO L116 PetriNetUnfolderBase]: 31/94 cut-off events. [2025-04-14 00:42:25,136 INFO L117 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-04-14 00:42:25,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 94 events. 31/94 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 312 event pairs, 3 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 256. Up to 46 conditions per place. [2025-04-14 00:42:25,137 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 26 selfloop transitions, 7 changer transitions 7/40 dead transitions. [2025-04-14 00:42:25,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 40 transitions, 211 flow [2025-04-14 00:42:25,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:42:25,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:42:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-04-14 00:42:25,138 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-04-14 00:42:25,138 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 67 flow. Second operand 6 states and 58 transitions. [2025-04-14 00:42:25,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 40 transitions, 211 flow [2025-04-14 00:42:25,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 40 transitions, 207 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-14 00:42:25,140 INFO L231 Difference]: Finished difference. Result has 32 places, 19 transitions, 96 flow [2025-04-14 00:42:25,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2025-04-14 00:42:25,140 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 8 predicate places. [2025-04-14 00:42:25,140 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 19 transitions, 96 flow [2025-04-14 00:42:25,140 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:42:25,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:42:25,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:42:25,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:42:25,141 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:42:25,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:42:25,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1879729670, now seen corresponding path program 3 times [2025-04-14 00:42:25,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:42:25,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690026882] [2025-04-14 00:42:25,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:42:25,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:42:25,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:42:25,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:42:25,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:42:25,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:42:25,732 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:42:25,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:42:25,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690026882] [2025-04-14 00:42:25,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690026882] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:42:25,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:42:25,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:42:25,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216567239] [2025-04-14 00:42:25,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:42:25,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:42:25,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:42:25,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:42:25,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:42:25,733 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-14 00:42:25,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 19 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:42:25,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:42:25,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-14 00:42:25,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:42:25,905 INFO L116 PetriNetUnfolderBase]: 28/85 cut-off events. [2025-04-14 00:42:25,905 INFO L117 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-04-14 00:42:25,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 85 events. 28/85 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 262 event pairs, 1 based on Foata normal form. 1/86 useless extension candidates. Maximal degree in co-relation 284. Up to 42 conditions per place. [2025-04-14 00:42:25,906 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 23 selfloop transitions, 6 changer transitions 9/38 dead transitions. [2025-04-14 00:42:25,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 233 flow [2025-04-14 00:42:25,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:42:25,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:42:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2025-04-14 00:42:25,911 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-04-14 00:42:25,911 INFO L175 Difference]: Start difference. First operand has 32 places, 19 transitions, 96 flow. Second operand 6 states and 56 transitions. [2025-04-14 00:42:25,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 233 flow [2025-04-14 00:42:25,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 219 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-14 00:42:25,913 INFO L231 Difference]: Finished difference. Result has 36 places, 18 transitions, 96 flow [2025-04-14 00:42:25,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=36, PETRI_TRANSITIONS=18} [2025-04-14 00:42:25,913 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 12 predicate places. [2025-04-14 00:42:25,913 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 18 transitions, 96 flow [2025-04-14 00:42:25,914 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:42:25,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:42:25,914 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:42:25,914 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:42:25,914 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:42:25,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:42:25,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1049223860, now seen corresponding path program 4 times [2025-04-14 00:42:25,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:42:25,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518631933] [2025-04-14 00:42:25,914 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:42:25,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:42:25,921 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:42:25,930 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:42:25,930 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:42:25,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:42:26,569 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:42:26,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:42:26,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518631933] [2025-04-14 00:42:26,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518631933] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:42:26,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:42:26,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:42:26,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127352543] [2025-04-14 00:42:26,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:42:26,570 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:42:26,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:42:26,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:42:26,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:42:26,570 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-14 00:42:26,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 18 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:42:26,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:42:26,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-14 00:42:26,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:42:26,802 INFO L116 PetriNetUnfolderBase]: 15/50 cut-off events. [2025-04-14 00:42:26,802 INFO L117 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-04-14 00:42:26,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 50 events. 15/50 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 109 event pairs, 0 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 179. Up to 16 conditions per place. [2025-04-14 00:42:26,803 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 16 selfloop transitions, 5 changer transitions 10/31 dead transitions. [2025-04-14 00:42:26,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 199 flow [2025-04-14 00:42:26,804 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:42:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:42:26,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2025-04-14 00:42:26,804 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4537037037037037 [2025-04-14 00:42:26,804 INFO L175 Difference]: Start difference. First operand has 36 places, 18 transitions, 96 flow. Second operand 6 states and 49 transitions. [2025-04-14 00:42:26,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 199 flow [2025-04-14 00:42:26,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 182 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-04-14 00:42:26,806 INFO L231 Difference]: Finished difference. Result has 35 places, 16 transitions, 77 flow [2025-04-14 00:42:26,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=77, PETRI_PLACES=35, PETRI_TRANSITIONS=16} [2025-04-14 00:42:26,806 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2025-04-14 00:42:26,806 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 16 transitions, 77 flow [2025-04-14 00:42:26,806 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:42:26,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:42:26,806 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:42:26,807 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:42:26,807 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:42:26,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:42:26,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1002086810, now seen corresponding path program 5 times [2025-04-14 00:42:26,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:42:26,807 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219586802] [2025-04-14 00:42:26,807 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:42:26,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:42:26,813 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:42:26,823 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:42:26,823 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:42:26,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:42:27,246 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:42:27,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:42:27,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219586802] [2025-04-14 00:42:27,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219586802] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:42:27,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:42:27,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:42:27,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623922665] [2025-04-14 00:42:27,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:42:27,247 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:42:27,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:42:27,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:42:27,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:42:27,248 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-14 00:42:27,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 16 transitions, 77 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:42:27,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:42:27,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-14 00:42:27,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:42:27,508 INFO L116 PetriNetUnfolderBase]: 8/36 cut-off events. [2025-04-14 00:42:27,508 INFO L117 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-04-14 00:42:27,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 36 events. 8/36 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 126. Up to 17 conditions per place. [2025-04-14 00:42:27,509 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 13 selfloop transitions, 3 changer transitions 10/26 dead transitions. [2025-04-14 00:42:27,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 26 transitions, 162 flow [2025-04-14 00:42:27,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:42:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:42:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2025-04-14 00:42:27,510 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-04-14 00:42:27,510 INFO L175 Difference]: Start difference. First operand has 35 places, 16 transitions, 77 flow. Second operand 6 states and 45 transitions. [2025-04-14 00:42:27,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 26 transitions, 162 flow [2025-04-14 00:42:27,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 128 flow, removed 4 selfloop flow, removed 9 redundant places. [2025-04-14 00:42:27,511 INFO L231 Difference]: Finished difference. Result has 31 places, 14 transitions, 52 flow [2025-04-14 00:42:27,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=14} [2025-04-14 00:42:27,511 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 7 predicate places. [2025-04-14 00:42:27,512 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 14 transitions, 52 flow [2025-04-14 00:42:27,512 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:42:27,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:42:27,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:42:27,512 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:42:27,512 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:42:27,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:42:27,512 INFO L85 PathProgramCache]: Analyzing trace with hash -143212280, now seen corresponding path program 6 times [2025-04-14 00:42:27,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:42:27,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895040627] [2025-04-14 00:42:27,513 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:42:27,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:42:27,520 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:42:27,536 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:42:27,536 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:42:27,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:42:28,185 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:42:28,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:42:28,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895040627] [2025-04-14 00:42:28,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895040627] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:42:28,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:42:28,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:42:28,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106855463] [2025-04-14 00:42:28,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:42:28,186 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:42:28,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:42:28,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:42:28,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:42:28,187 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-14 00:42:28,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 14 transitions, 52 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:42:28,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:42:28,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-14 00:42:28,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:42:28,411 INFO L116 PetriNetUnfolderBase]: 3/19 cut-off events. [2025-04-14 00:42:28,411 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-14 00:42:28,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 19 events. 3/19 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 1/20 useless extension candidates. Maximal degree in co-relation 58. Up to 7 conditions per place. [2025-04-14 00:42:28,412 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 0 selfloop transitions, 0 changer transitions 16/16 dead transitions. [2025-04-14 00:42:28,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 16 transitions, 86 flow [2025-04-14 00:42:28,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:42:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:42:28,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2025-04-14 00:42:28,414 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32407407407407407 [2025-04-14 00:42:28,414 INFO L175 Difference]: Start difference. First operand has 31 places, 14 transitions, 52 flow. Second operand 6 states and 35 transitions. [2025-04-14 00:42:28,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 16 transitions, 86 flow [2025-04-14 00:42:28,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 16 transitions, 74 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-04-14 00:42:28,415 INFO L231 Difference]: Finished difference. Result has 27 places, 0 transitions, 0 flow [2025-04-14 00:42:28,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=27, PETRI_TRANSITIONS=0} [2025-04-14 00:42:28,415 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 3 predicate places. [2025-04-14 00:42:28,415 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 0 transitions, 0 flow [2025-04-14 00:42:28,415 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:42:28,418 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 00:42:28,418 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 00:42:28,418 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 00:42:28,418 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 00:42:28,418 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:42:28,419 INFO L422 BasicCegarLoop]: Path program histogram: [6] [2025-04-14 00:42:28,421 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:42:28,421 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:42:28,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:42:28 BasicIcfg [2025-04-14 00:42:28,427 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:42:28,427 INFO L158 Benchmark]: Toolchain (without parser) took 7202.02ms. Allocated memory was 142.6MB in the beginning and 415.2MB in the end (delta: 272.6MB). Free memory was 101.7MB in the beginning and 247.8MB in the end (delta: -146.1MB). Peak memory consumption was 123.8MB. Max. memory is 8.0GB. [2025-04-14 00:42:28,428 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:42:28,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.54ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 86.9MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-14 00:42:28,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.06ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 84.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:42:28,428 INFO L158 Benchmark]: Boogie Preprocessor took 50.69ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 82.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:42:28,428 INFO L158 Benchmark]: IcfgBuilder took 620.54ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 82.2MB in the end (delta: 642.4kB). Peak memory consumption was 65.1MB. Max. memory is 8.0GB. [2025-04-14 00:42:28,428 INFO L158 Benchmark]: TraceAbstraction took 6208.73ms. Allocated memory was 142.6MB in the beginning and 415.2MB in the end (delta: 272.6MB). Free memory was 81.5MB in the beginning and 247.8MB in the end (delta: -166.3MB). Peak memory consumption was 104.8MB. Max. memory is 8.0GB. [2025-04-14 00:42:28,429 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.29ms. Allocated memory is still 142.6MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 275.54ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 86.9MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.06ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 84.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.69ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 82.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 620.54ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 82.2MB in the end (delta: 642.4kB). Peak memory consumption was 65.1MB. Max. memory is 8.0GB. * TraceAbstraction took 6208.73ms. Allocated memory was 142.6MB in the beginning and 415.2MB in the end (delta: 272.6MB). Free memory was 81.5MB in the beginning and 247.8MB in the end (delta: -166.3MB). Peak memory consumption was 104.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 81]: 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, 28 locations, 27 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: 6.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 140 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 140 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 387 IncrementalHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 0 mSDtfsCounter, 387 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=2, 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.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 1745 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:42:28,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...