/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/chl-exp-term-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:59:35,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:59:35,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:59:35,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:59:35,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:59:36,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:59:36,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:59:36,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:59:36,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:59:36,017 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:59:36,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:59:36,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:59:36,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:59:36,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:59:36,018 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:59:36,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:59:36,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:59:36,018 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:59:36,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:59:36,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:59:36,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:59:36,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:59:36,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:59:36,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:59:36,018 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:59:36,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:59:36,019 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:59:36,019 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:59:36,019 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:59:36,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:59:36,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:59:36,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:59:36,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:59:36,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:59:36,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:59:36,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:59:36,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:59:36,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:59:36,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:59:36,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:59:36,019 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:59:36,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:59:36,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:59:36,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:59:36,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:59:36,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:59:36,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:59:36,020 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:59:36,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:59:36,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:59:36,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:59:36,245 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:59:36,245 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:59:36,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-exp-term-subst.wvr.c [2025-04-13 19:59:37,573 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a021164/ab6651c09efc4235ab6083459e07dbe1/FLAG0be3be754 [2025-04-13 19:59:37,794 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:59:37,795 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-exp-term-subst.wvr.c [2025-04-13 19:59:37,802 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a021164/ab6651c09efc4235ab6083459e07dbe1/FLAG0be3be754 [2025-04-13 19:59:38,573 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a021164/ab6651c09efc4235ab6083459e07dbe1 [2025-04-13 19:59:38,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:59:38,576 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:59:38,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:59:38,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:59:38,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:59:38,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:59:38" (1/1) ... [2025-04-13 19:59:38,584 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386b281c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:38, skipping insertion in model container [2025-04-13 19:59:38,584 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:59:38" (1/1) ... [2025-04-13 19:59:38,598 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:59:38,763 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-exp-term-subst.wvr.c[3111,3124] [2025-04-13 19:59:38,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:59:38,784 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:59:38,819 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-exp-term-subst.wvr.c[3111,3124] [2025-04-13 19:59:38,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:59:38,833 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:59:38,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:38 WrapperNode [2025-04-13 19:59:38,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:59:38,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:59:38,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:59:38,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:59:38,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:38" (1/1) ... [2025-04-13 19:59:38,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:38" (1/1) ... [2025-04-13 19:59:38,875 INFO L138 Inliner]: procedures = 22, calls = 16, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 169 [2025-04-13 19:59:38,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:59:38,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:59:38,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:59:38,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:59:38,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:38" (1/1) ... [2025-04-13 19:59:38,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:38" (1/1) ... [2025-04-13 19:59:38,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:38" (1/1) ... [2025-04-13 19:59:38,901 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 19:59:38,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:38" (1/1) ... [2025-04-13 19:59:38,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:38" (1/1) ... [2025-04-13 19:59:38,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:38" (1/1) ... [2025-04-13 19:59:38,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:38" (1/1) ... [2025-04-13 19:59:38,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:38" (1/1) ... [2025-04-13 19:59:38,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:38" (1/1) ... [2025-04-13 19:59:38,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:38" (1/1) ... [2025-04-13 19:59:38,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:59:38,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:59:38,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:59:38,914 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:59:38,915 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:38" (1/1) ... [2025-04-13 19:59:38,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:59:38,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:38,938 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 19:59:38,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 19:59:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:59:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 19:59:38,957 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 19:59:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 19:59:38,957 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 19:59:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 19:59:38,957 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 19:59:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:59:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:59:38,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:59:38,958 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:59:39,036 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:59:39,037 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:59:39,321 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:59:39,321 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:59:39,321 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:59:39,648 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:59:39,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:59:39 BoogieIcfgContainer [2025-04-13 19:59:39,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:59:39,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:59:39,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:59:39,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:59:39,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:59:38" (1/3) ... [2025-04-13 19:59:39,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37eff53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:59:39, skipping insertion in model container [2025-04-13 19:59:39,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:38" (2/3) ... [2025-04-13 19:59:39,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37eff53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:59:39, skipping insertion in model container [2025-04-13 19:59:39,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:59:39" (3/3) ... [2025-04-13 19:59:39,656 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-exp-term-subst.wvr.c [2025-04-13 19:59:39,668 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:59:39,669 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-exp-term-subst.wvr.c that has 4 procedures, 19 locations, 15 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 19:59:39,669 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:59:39,715 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 19:59:39,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 18 transitions, 57 flow [2025-04-13 19:59:39,766 INFO L116 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-04-13 19:59:39,768 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 19:59:39,769 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-13 19:59:39,770 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 18 transitions, 57 flow [2025-04-13 19:59:39,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 14 transitions, 46 flow [2025-04-13 19:59:39,781 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:59:39,791 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;@7c90f7e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:59:39,791 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:59:39,805 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:59:39,806 INFO L116 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-04-13 19:59:39,806 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 19:59:39,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:39,806 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:39,807 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:59:39,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:39,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1248590384, now seen corresponding path program 1 times [2025-04-13 19:59:39,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:39,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9681157] [2025-04-13 19:59:39,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:59:39,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:39,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:59:40,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:59:40,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:59:40,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:59:42,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:42,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9681157] [2025-04-13 19:59:42,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9681157] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:42,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:42,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:59:42,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027555472] [2025-04-13 19:59:42,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:42,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:42,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:42,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:42,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:59:42,559 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-13 19:59:42,561 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-13 19:59:42,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:42,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-13 19:59:42,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:42,983 INFO L116 PetriNetUnfolderBase]: 32/83 cut-off events. [2025-04-13 19:59:42,984 INFO L117 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-04-13 19:59:42,984 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-13 19:59:42,985 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 26 selfloop transitions, 6 changer transitions 5/37 dead transitions. [2025-04-13 19:59:42,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 37 transitions, 196 flow [2025-04-13 19:59:42,986 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:59:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:59:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2025-04-13 19:59:42,993 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-04-13 19:59:42,994 INFO L175 Difference]: Start difference. First operand has 24 places, 14 transitions, 46 flow. Second operand 6 states and 56 transitions. [2025-04-13 19:59:42,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 37 transitions, 196 flow [2025-04-13 19:59:42,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 37 transitions, 164 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 19:59:42,999 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 67 flow [2025-04-13 19:59:43,000 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-13 19:59:43,003 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2025-04-13 19:59:43,003 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 67 flow [2025-04-13 19:59:43,003 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-13 19:59:43,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:43,003 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:43,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:59:43,003 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:59:43,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:43,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1297531972, now seen corresponding path program 2 times [2025-04-13 19:59:43,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:43,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670370041] [2025-04-13 19:59:43,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:59:43,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:43,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:59:43,069 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:59:43,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:59:43,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:59:44,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:44,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670370041] [2025-04-13 19:59:44,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670370041] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:44,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:44,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:59:44,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134804968] [2025-04-13 19:59:44,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:44,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:44,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:44,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:44,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:59:44,476 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-13 19:59:44,476 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-13 19:59:44,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:44,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-13 19:59:44,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:44,723 INFO L116 PetriNetUnfolderBase]: 31/94 cut-off events. [2025-04-13 19:59:44,724 INFO L117 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-04-13 19:59:44,724 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 315 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-13 19:59:44,725 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 26 selfloop transitions, 7 changer transitions 7/40 dead transitions. [2025-04-13 19:59:44,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 40 transitions, 211 flow [2025-04-13 19:59:44,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:59:44,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:59:44,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-04-13 19:59:44,726 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-04-13 19:59:44,726 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 67 flow. Second operand 6 states and 58 transitions. [2025-04-13 19:59:44,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 40 transitions, 211 flow [2025-04-13 19:59:44,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 40 transitions, 207 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 19:59:44,727 INFO L231 Difference]: Finished difference. Result has 32 places, 19 transitions, 96 flow [2025-04-13 19:59:44,728 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-13 19:59:44,728 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 8 predicate places. [2025-04-13 19:59:44,728 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 19 transitions, 96 flow [2025-04-13 19:59:44,728 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-13 19:59:44,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:44,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:44,728 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:59:44,728 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:59:44,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:44,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1269163252, now seen corresponding path program 3 times [2025-04-13 19:59:44,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:44,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200207956] [2025-04-13 19:59:44,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:59:44,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:44,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:59:44,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:59:44,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:59:44,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:59:45,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:45,815 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200207956] [2025-04-13 19:59:45,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200207956] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:45,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:45,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:59:45,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624800596] [2025-04-13 19:59:45,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:45,815 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:59:45,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:45,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:59:45,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:59:45,816 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-13 19:59:45,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 19 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:45,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:45,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-13 19:59:45,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:46,152 INFO L116 PetriNetUnfolderBase]: 28/85 cut-off events. [2025-04-13 19:59:46,152 INFO L117 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-04-13 19:59:46,152 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 265 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-13 19:59:46,153 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 23 selfloop transitions, 6 changer transitions 9/38 dead transitions. [2025-04-13 19:59:46,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 233 flow [2025-04-13 19:59:46,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:59:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:59:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2025-04-13 19:59:46,155 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2025-04-13 19:59:46,155 INFO L175 Difference]: Start difference. First operand has 32 places, 19 transitions, 96 flow. Second operand 7 states and 59 transitions. [2025-04-13 19:59:46,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 233 flow [2025-04-13 19:59:46,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 219 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-13 19:59:46,157 INFO L231 Difference]: Finished difference. Result has 37 places, 18 transitions, 96 flow [2025-04-13 19:59:46,157 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=7, PETRI_FLOW=96, PETRI_PLACES=37, PETRI_TRANSITIONS=18} [2025-04-13 19:59:46,157 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 13 predicate places. [2025-04-13 19:59:46,157 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 18 transitions, 96 flow [2025-04-13 19:59:46,158 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:46,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:46,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:46,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:59:46,158 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:59:46,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:46,158 INFO L85 PathProgramCache]: Analyzing trace with hash -438657442, now seen corresponding path program 4 times [2025-04-13 19:59:46,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:46,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286779789] [2025-04-13 19:59:46,158 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:59:46,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:46,165 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 19:59:46,176 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:59:46,177 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:59:46,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:47,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:59:47,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:47,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286779789] [2025-04-13 19:59:47,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286779789] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:47,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:47,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:59:47,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550336918] [2025-04-13 19:59:47,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:47,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:47,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:47,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:47,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:59:47,144 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-13 19:59:47,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 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-13 19:59:47,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:47,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-13 19:59:47,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:47,430 INFO L116 PetriNetUnfolderBase]: 15/50 cut-off events. [2025-04-13 19:59:47,430 INFO L117 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-04-13 19:59:47,431 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 111 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-13 19:59:47,431 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 16 selfloop transitions, 5 changer transitions 10/31 dead transitions. [2025-04-13 19:59:47,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 199 flow [2025-04-13 19:59:47,432 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:59:47,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:59:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2025-04-13 19:59:47,434 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4537037037037037 [2025-04-13 19:59:47,434 INFO L175 Difference]: Start difference. First operand has 37 places, 18 transitions, 96 flow. Second operand 6 states and 49 transitions. [2025-04-13 19:59:47,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 199 flow [2025-04-13 19:59:47,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 177 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-04-13 19:59:47,438 INFO L231 Difference]: Finished difference. Result has 34 places, 16 transitions, 74 flow [2025-04-13 19:59:47,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=28, 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=74, PETRI_PLACES=34, PETRI_TRANSITIONS=16} [2025-04-13 19:59:47,439 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 10 predicate places. [2025-04-13 19:59:47,439 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 16 transitions, 74 flow [2025-04-13 19:59:47,439 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-13 19:59:47,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:47,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:47,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:59:47,440 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:59:47,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:47,440 INFO L85 PathProgramCache]: Analyzing trace with hash -389732932, now seen corresponding path program 5 times [2025-04-13 19:59:47,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:47,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210318448] [2025-04-13 19:59:47,440 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:59:47,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:47,452 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:59:47,477 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:59:47,477 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:59:47,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:48,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:59:48,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:48,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210318448] [2025-04-13 19:59:48,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210318448] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:48,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:48,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:59:48,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458479135] [2025-04-13 19:59:48,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:48,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:59:48,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:48,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:59:48,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:59:48,539 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-13 19:59:48,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 16 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:48,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:48,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-13 19:59:48,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:48,886 INFO L116 PetriNetUnfolderBase]: 8/36 cut-off events. [2025-04-13 19:59:48,887 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 19:59:48,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 36 events. 8/36 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 125. Up to 17 conditions per place. [2025-04-13 19:59:48,887 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 13 selfloop transitions, 3 changer transitions 10/26 dead transitions. [2025-04-13 19:59:48,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 26 transitions, 158 flow [2025-04-13 19:59:48,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:59:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:59:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2025-04-13 19:59:48,889 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2025-04-13 19:59:48,889 INFO L175 Difference]: Start difference. First operand has 34 places, 16 transitions, 74 flow. Second operand 7 states and 48 transitions. [2025-04-13 19:59:48,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 26 transitions, 158 flow [2025-04-13 19:59:48,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 128 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-04-13 19:59:48,890 INFO L231 Difference]: Finished difference. Result has 32 places, 14 transitions, 52 flow [2025-04-13 19:59:48,890 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=7, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=14} [2025-04-13 19:59:48,890 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 8 predicate places. [2025-04-13 19:59:48,890 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 14 transitions, 52 flow [2025-04-13 19:59:48,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:48,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:48,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:48,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:59:48,891 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:59:48,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:48,891 INFO L85 PathProgramCache]: Analyzing trace with hash 469141598, now seen corresponding path program 6 times [2025-04-13 19:59:48,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:48,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257213839] [2025-04-13 19:59:48,891 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:59:48,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:48,898 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:59:48,915 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:59:48,916 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:59:48,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:49,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:59:49,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:49,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257213839] [2025-04-13 19:59:49,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257213839] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:49,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:49,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:59:49,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289696313] [2025-04-13 19:59:49,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:49,646 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:49,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:49,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:49,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:59:49,647 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-13 19:59:49,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 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-13 19:59:49,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:49,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-13 19:59:49,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:49,924 INFO L116 PetriNetUnfolderBase]: 3/19 cut-off events. [2025-04-13 19:59:49,924 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-13 19:59:49,925 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-13 19:59:49,925 INFO L140 encePairwiseOnDemand]: 13/18 looper letters, 0 selfloop transitions, 0 changer transitions 16/16 dead transitions. [2025-04-13 19:59:49,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 16 transitions, 86 flow [2025-04-13 19:59:49,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:59:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:59:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2025-04-13 19:59:49,929 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32407407407407407 [2025-04-13 19:59:49,929 INFO L175 Difference]: Start difference. First operand has 32 places, 14 transitions, 52 flow. Second operand 6 states and 35 transitions. [2025-04-13 19:59:49,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 16 transitions, 86 flow [2025-04-13 19:59:49,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 16 transitions, 71 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-04-13 19:59:49,929 INFO L231 Difference]: Finished difference. Result has 26 places, 0 transitions, 0 flow [2025-04-13 19:59:49,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=33, PETRI_DIFFERENCE_MINUEND_PLACES=21, 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=26, PETRI_TRANSITIONS=0} [2025-04-13 19:59:49,930 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2025-04-13 19:59:49,930 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 0 transitions, 0 flow [2025-04-13 19:59:49,930 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-13 19:59:49,932 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 19:59:49,932 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 19:59:49,932 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 19:59:49,932 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 19:59:49,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:59:49,933 INFO L422 BasicCegarLoop]: Path program histogram: [6] [2025-04-13 19:59:49,935 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:59:49,935 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:59:49,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:59:49 BasicIcfg [2025-04-13 19:59:49,938 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:59:49,938 INFO L158 Benchmark]: Toolchain (without parser) took 11362.37ms. Allocated memory was 155.2MB in the beginning and 570.4MB in the end (delta: 415.2MB). Free memory was 109.4MB in the beginning and 259.0MB in the end (delta: -149.6MB). Peak memory consumption was 265.1MB. Max. memory is 8.0GB. [2025-04-13 19:59:49,938 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:59:49,938 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.87ms. Allocated memory is still 155.2MB. Free memory was 109.4MB in the beginning and 94.5MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 19:59:49,939 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.10ms. Allocated memory is still 155.2MB. Free memory was 94.5MB in the beginning and 92.2MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:59:49,939 INFO L158 Benchmark]: Boogie Preprocessor took 38.02ms. Allocated memory is still 155.2MB. Free memory was 92.2MB in the beginning and 90.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:59:49,939 INFO L158 Benchmark]: RCFGBuilder took 734.70ms. Allocated memory is still 155.2MB. Free memory was 90.1MB in the beginning and 81.9MB in the end (delta: 8.1MB). Peak memory consumption was 73.7MB. Max. memory is 8.0GB. [2025-04-13 19:59:49,939 INFO L158 Benchmark]: TraceAbstraction took 10287.10ms. Allocated memory was 155.2MB in the beginning and 570.4MB in the end (delta: 415.2MB). Free memory was 81.2MB in the beginning and 259.0MB in the end (delta: -177.9MB). Peak memory consumption was 237.5MB. Max. memory is 8.0GB. [2025-04-13 19:59:49,940 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.79ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.87ms. Allocated memory is still 155.2MB. Free memory was 109.4MB in the beginning and 94.5MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.10ms. Allocated memory is still 155.2MB. Free memory was 94.5MB in the beginning and 92.2MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.02ms. Allocated memory is still 155.2MB. Free memory was 92.2MB in the beginning and 90.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 734.70ms. Allocated memory is still 155.2MB. Free memory was 90.1MB in the beginning and 81.9MB in the end (delta: 8.1MB). Peak memory consumption was 73.7MB. Max. memory is 8.0GB. * TraceAbstraction took 10287.10ms. Allocated memory was 155.2MB in the beginning and 570.4MB in the end (delta: 415.2MB). Free memory was 81.2MB in the beginning and 259.0MB in the end (delta: -177.9MB). Peak memory consumption was 237.5MB. 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: 10.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 180 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 373 IncrementalHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 0 mSDtfsCounter, 373 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=2, InterpolantAutomatonStates: 38, 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.4s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 2791 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-13 19:59:49,953 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...