/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:35:07,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:35:07,778 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:35:07,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:35:07,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:35:07,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:35:07,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:35:07,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:35:07,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:35:07,810 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:35:07,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:35:07,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:35:07,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:35:07,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:35:07,812 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:35:07,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:35:07,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:35:07,812 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:35:07,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:35:07,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:35:07,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:35:07,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:35:07,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:35:07,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:35:07,812 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:35:07,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:35:07,812 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:35:07,813 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:35:07,813 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:35:07,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:35:07,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:35:07,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:35:07,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:35:07,813 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:35:07,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:35:07,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:35:07,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:35:07,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:35:07,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:35:07,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:35:07,813 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:35:07,814 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:35:07,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:35:07,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:35:07,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:35:07,814 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:35:07,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:35:07,814 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:35:08,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:35:08,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:35:08,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:35:08,064 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:35:08,066 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:35:08,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_tso.i [2025-04-13 19:35:09,358 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ee7b54ed/44ce84dba4e54431b19c019462100dd7/FLAGaeefbb126 [2025-04-13 19:35:09,609 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:35:09,609 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_tso.i [2025-04-13 19:35:09,621 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ee7b54ed/44ce84dba4e54431b19c019462100dd7/FLAGaeefbb126 [2025-04-13 19:35:10,408 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ee7b54ed/44ce84dba4e54431b19c019462100dd7 [2025-04-13 19:35:10,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:35:10,411 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:35:10,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:35:10,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:35:10,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:35:10,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:35:10" (1/1) ... [2025-04-13 19:35:10,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dbb6db4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:10, skipping insertion in model container [2025-04-13 19:35:10,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:35:10" (1/1) ... [2025-04-13 19:35:10,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:35:10,609 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_tso.i[987,1000] [2025-04-13 19:35:10,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:35:10,836 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:35:10,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_tso.i[987,1000] [2025-04-13 19:35:10,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:35:10,926 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:35:10,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:10 WrapperNode [2025-04-13 19:35:10,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:35:10,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:35:10,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:35:10,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:35:10,931 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:35:10" (1/1) ... [2025-04-13 19:35:10,942 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:35:10" (1/1) ... [2025-04-13 19:35:10,965 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 206 [2025-04-13 19:35:10,965 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:35:10,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:35:10,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:35:10,966 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:35:10,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:10" (1/1) ... [2025-04-13 19:35:10,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:10" (1/1) ... [2025-04-13 19:35:10,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:10" (1/1) ... [2025-04-13 19:35:11,000 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:35:11,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:10" (1/1) ... [2025-04-13 19:35:11,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:10" (1/1) ... [2025-04-13 19:35:11,006 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:10" (1/1) ... [2025-04-13 19:35:11,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:10" (1/1) ... [2025-04-13 19:35:11,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:10" (1/1) ... [2025-04-13 19:35:11,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:10" (1/1) ... [2025-04-13 19:35:11,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:10" (1/1) ... [2025-04-13 19:35:11,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:35:11,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:35:11,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:35:11,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:35:11,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:10" (1/1) ... [2025-04-13 19:35:11,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:35:11,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:35:11,040 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:35:11,043 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:35:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:35:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:35:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 19:35:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 19:35:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 19:35:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 19:35:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:35:11,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:35:11,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:35:11,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:35:11,063 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:35:11,143 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:35:11,144 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:35:11,463 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:35:11,464 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:35:11,464 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:35:11,788 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:35:11,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:35:11 BoogieIcfgContainer [2025-04-13 19:35:11,788 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:35:11,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:35:11,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:35:11,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:35:11,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:35:10" (1/3) ... [2025-04-13 19:35:11,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8c3671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:35:11, skipping insertion in model container [2025-04-13 19:35:11,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:10" (2/3) ... [2025-04-13 19:35:11,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8c3671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:35:11, skipping insertion in model container [2025-04-13 19:35:11,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:35:11" (3/3) ... [2025-04-13 19:35:11,796 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi002_tso.i [2025-04-13 19:35:11,807 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:35:11,809 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi002_tso.i that has 3 procedures, 31 locations, 28 edges, 1 initial locations, 0 loop locations, and 3 error locations. [2025-04-13 19:35:11,809 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:35:11,852 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:35:11,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2025-04-13 19:35:11,891 INFO L116 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-04-13 19:35:11,892 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:35:11,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-13 19:35:11,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 30 transitions, 68 flow [2025-04-13 19:35:11,894 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 28 transitions, 62 flow [2025-04-13 19:35:11,902 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:35:11,914 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;@58bfc88a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:35:11,914 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:35:11,918 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:35:11,918 INFO L116 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-04-13 19:35:11,918 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:35:11,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:11,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:35:11,918 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:11,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:11,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1447913743, now seen corresponding path program 1 times [2025-04-13 19:35:11,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:11,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749651172] [2025-04-13 19:35:11,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:11,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:11,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:35:12,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:35:12,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:12,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:12,290 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:35:12,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:12,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749651172] [2025-04-13 19:35:12,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749651172] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:12,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:12,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:35:12,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446504411] [2025-04-13 19:35:12,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:12,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:35:12,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:12,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:35:12,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:35:12,317 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-04-13 19:35:12,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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:35:12,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:12,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-04-13 19:35:12,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:12,603 INFO L116 PetriNetUnfolderBase]: 438/775 cut-off events. [2025-04-13 19:35:12,603 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 19:35:12,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1520 conditions, 775 events. 438/775 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3972 event pairs, 32 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 1510. Up to 652 conditions per place. [2025-04-13 19:35:12,612 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 29 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-04-13 19:35:12,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 142 flow [2025-04-13 19:35:12,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:35:12,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:35:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-04-13 19:35:12,622 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2025-04-13 19:35:12,623 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 62 flow. Second operand 3 states and 56 transitions. [2025-04-13 19:35:12,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 142 flow [2025-04-13 19:35:12,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:35:12,628 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 62 flow [2025-04-13 19:35:12,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2025-04-13 19:35:12,632 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2025-04-13 19:35:12,632 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 62 flow [2025-04-13 19:35:12,632 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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:35:12,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:12,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:12,633 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:35:12,633 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:12,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:12,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1935652526, now seen corresponding path program 1 times [2025-04-13 19:35:12,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:12,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589908518] [2025-04-13 19:35:12,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:12,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:12,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:35:12,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:35:12,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:12,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:12,832 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:35:12,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:12,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589908518] [2025-04-13 19:35:12,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589908518] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:12,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:12,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:35:12,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286442376] [2025-04-13 19:35:12,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:12,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:35:12,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:12,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:35:12,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:35:12,834 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-04-13 19:35:12,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:35:12,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:12,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-04-13 19:35:12,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:13,041 INFO L116 PetriNetUnfolderBase]: 380/687 cut-off events. [2025-04-13 19:35:13,042 INFO L117 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-04-13 19:35:13,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1374 conditions, 687 events. 380/687 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3503 event pairs, 90 based on Foata normal form. 0/649 useless extension candidates. Maximal degree in co-relation 1364. Up to 466 conditions per place. [2025-04-13 19:35:13,048 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 26 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2025-04-13 19:35:13,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 140 flow [2025-04-13 19:35:13,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:35:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:35:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-04-13 19:35:13,050 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-04-13 19:35:13,050 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 62 flow. Second operand 3 states and 55 transitions. [2025-04-13 19:35:13,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 140 flow [2025-04-13 19:35:13,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:35:13,051 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 58 flow [2025-04-13 19:35:13,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2025-04-13 19:35:13,052 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2025-04-13 19:35:13,052 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 58 flow [2025-04-13 19:35:13,052 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:35:13,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:13,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:13,053 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:35:13,053 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:13,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:13,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1657527582, now seen corresponding path program 1 times [2025-04-13 19:35:13,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:13,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989152900] [2025-04-13 19:35:13,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:13,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:13,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:35:13,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:35:13,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:13,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:13,629 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:35:13,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:13,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989152900] [2025-04-13 19:35:13,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989152900] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:13,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:13,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:35:13,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862048807] [2025-04-13 19:35:13,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:13,629 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:35:13,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:13,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:35:13,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:35:13,636 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-04-13 19:35:13,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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:35:13,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:13,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-04-13 19:35:13,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:13,904 INFO L116 PetriNetUnfolderBase]: 307/588 cut-off events. [2025-04-13 19:35:13,904 INFO L117 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-04-13 19:35:13,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 588 events. 307/588 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2992 event pairs, 93 based on Foata normal form. 35/622 useless extension candidates. Maximal degree in co-relation 1160. Up to 338 conditions per place. [2025-04-13 19:35:13,907 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 28 selfloop transitions, 2 changer transitions 17/53 dead transitions. [2025-04-13 19:35:13,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 53 transitions, 216 flow [2025-04-13 19:35:13,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:35:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:35:13,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2025-04-13 19:35:13,908 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5933333333333334 [2025-04-13 19:35:13,908 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 58 flow. Second operand 5 states and 89 transitions. [2025-04-13 19:35:13,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 53 transitions, 216 flow [2025-04-13 19:35:13,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 53 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:35:13,909 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 66 flow [2025-04-13 19:35:13,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2025-04-13 19:35:13,910 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-04-13 19:35:13,910 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 66 flow [2025-04-13 19:35:13,910 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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:35:13,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:13,910 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:13,910 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:35:13,910 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:13,911 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:13,911 INFO L85 PathProgramCache]: Analyzing trace with hash -116368062, now seen corresponding path program 1 times [2025-04-13 19:35:13,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:13,911 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294653025] [2025-04-13 19:35:13,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:13,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:13,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:35:13,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:35:13,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:13,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:14,197 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:35:14,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:14,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294653025] [2025-04-13 19:35:14,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294653025] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:14,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:14,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:35:14,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347496683] [2025-04-13 19:35:14,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:14,199 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:35:14,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:14,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:35:14,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:35:14,199 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-04-13 19:35:14,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:35:14,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:14,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-04-13 19:35:14,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:14,385 INFO L116 PetriNetUnfolderBase]: 260/495 cut-off events. [2025-04-13 19:35:14,385 INFO L117 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2025-04-13 19:35:14,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1075 conditions, 495 events. 260/495 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2314 event pairs, 100 based on Foata normal form. 21/510 useless extension candidates. Maximal degree in co-relation 1062. Up to 263 conditions per place. [2025-04-13 19:35:14,387 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 24 selfloop transitions, 2 changer transitions 11/43 dead transitions. [2025-04-13 19:35:14,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 181 flow [2025-04-13 19:35:14,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:35:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:35:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-04-13 19:35:14,388 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2025-04-13 19:35:14,388 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 66 flow. Second operand 5 states and 79 transitions. [2025-04-13 19:35:14,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 181 flow [2025-04-13 19:35:14,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 171 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 19:35:14,390 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 70 flow [2025-04-13 19:35:14,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2025-04-13 19:35:14,391 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-04-13 19:35:14,391 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 70 flow [2025-04-13 19:35:14,391 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:35:14,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:14,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:14,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:35:14,391 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:14,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:14,392 INFO L85 PathProgramCache]: Analyzing trace with hash 419052241, now seen corresponding path program 1 times [2025-04-13 19:35:14,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:14,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101286442] [2025-04-13 19:35:14,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:14,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:14,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 19:35:14,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 19:35:14,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:14,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:16,031 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:35:16,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:16,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101286442] [2025-04-13 19:35:16,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101286442] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:16,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:16,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 19:35:16,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827566915] [2025-04-13 19:35:16,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:16,032 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 19:35:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:16,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 19:35:16,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:35:16,058 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2025-04-13 19:35:16,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 70 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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:35:16,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:16,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2025-04-13 19:35:16,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:16,661 INFO L116 PetriNetUnfolderBase]: 621/1055 cut-off events. [2025-04-13 19:35:16,661 INFO L117 PetriNetUnfolderBase]: For 183/183 co-relation queries the response was YES. [2025-04-13 19:35:16,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2423 conditions, 1055 events. 621/1055 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4913 event pairs, 55 based on Foata normal form. 27/1082 useless extension candidates. Maximal degree in co-relation 2409. Up to 606 conditions per place. [2025-04-13 19:35:16,666 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 51 selfloop transitions, 18 changer transitions 19/91 dead transitions. [2025-04-13 19:35:16,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 91 transitions, 406 flow [2025-04-13 19:35:16,667 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:35:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:35:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2025-04-13 19:35:16,670 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2025-04-13 19:35:16,670 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 70 flow. Second operand 11 states and 147 transitions. [2025-04-13 19:35:16,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 91 transitions, 406 flow [2025-04-13 19:35:16,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 91 transitions, 392 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 19:35:16,675 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 200 flow [2025-04-13 19:35:16,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=200, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2025-04-13 19:35:16,678 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2025-04-13 19:35:16,678 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 200 flow [2025-04-13 19:35:16,679 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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:35:16,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:16,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:16,679 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:35:16,679 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:16,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:16,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1798922023, now seen corresponding path program 2 times [2025-04-13 19:35:16,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:16,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953269693] [2025-04-13 19:35:16,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:35:16,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:16,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-13 19:35:16,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 19:35:16,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:35:16,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:17,635 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:35:17,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:17,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953269693] [2025-04-13 19:35:17,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953269693] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:17,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:17,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:35:17,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483895293] [2025-04-13 19:35:17,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:17,636 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:35:17,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:17,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:35:17,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:35:17,641 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2025-04-13 19:35:17,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 200 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:35:17,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:17,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2025-04-13 19:35:17,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:18,196 INFO L116 PetriNetUnfolderBase]: 562/1008 cut-off events. [2025-04-13 19:35:18,197 INFO L117 PetriNetUnfolderBase]: For 1452/1454 co-relation queries the response was YES. [2025-04-13 19:35:18,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3253 conditions, 1008 events. 562/1008 cut-off events. For 1452/1454 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5057 event pairs, 52 based on Foata normal form. 19/1020 useless extension candidates. Maximal degree in co-relation 3232. Up to 370 conditions per place. [2025-04-13 19:35:18,204 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 53 selfloop transitions, 35 changer transitions 12/107 dead transitions. [2025-04-13 19:35:18,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 107 transitions, 744 flow [2025-04-13 19:35:18,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:35:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:35:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 162 transitions. [2025-04-13 19:35:18,206 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-04-13 19:35:18,206 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 200 flow. Second operand 11 states and 162 transitions. [2025-04-13 19:35:18,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 107 transitions, 744 flow [2025-04-13 19:35:18,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 107 transitions, 706 flow, removed 19 selfloop flow, removed 3 redundant places. [2025-04-13 19:35:18,214 INFO L231 Difference]: Finished difference. Result has 61 places, 70 transitions, 512 flow [2025-04-13 19:35:18,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=512, PETRI_PLACES=61, PETRI_TRANSITIONS=70} [2025-04-13 19:35:18,215 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2025-04-13 19:35:18,215 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 70 transitions, 512 flow [2025-04-13 19:35:18,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:35:18,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:18,215 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:18,215 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:35:18,215 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:18,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:18,216 INFO L85 PathProgramCache]: Analyzing trace with hash 318224617, now seen corresponding path program 3 times [2025-04-13 19:35:18,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:18,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201808411] [2025-04-13 19:35:18,216 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:35:18,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:18,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 1 equivalence classes. [2025-04-13 19:35:18,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 19:35:18,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:35:18,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:19,541 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:35:19,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:19,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201808411] [2025-04-13 19:35:19,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201808411] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:19,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:19,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:35:19,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102769555] [2025-04-13 19:35:19,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:19,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:35:19,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:19,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:35:19,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:35:19,553 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2025-04-13 19:35:19,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 70 transitions, 512 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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:35:19,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:19,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2025-04-13 19:35:19,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:20,376 INFO L116 PetriNetUnfolderBase]: 864/1487 cut-off events. [2025-04-13 19:35:20,376 INFO L117 PetriNetUnfolderBase]: For 3347/3349 co-relation queries the response was YES. [2025-04-13 19:35:20,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5702 conditions, 1487 events. 864/1487 cut-off events. For 3347/3349 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7599 event pairs, 111 based on Foata normal form. 24/1510 useless extension candidates. Maximal degree in co-relation 5675. Up to 711 conditions per place. [2025-04-13 19:35:20,386 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 97 selfloop transitions, 58 changer transitions 14/172 dead transitions. [2025-04-13 19:35:20,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 172 transitions, 1466 flow [2025-04-13 19:35:20,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 19:35:20,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 19:35:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 186 transitions. [2025-04-13 19:35:20,388 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2025-04-13 19:35:20,388 INFO L175 Difference]: Start difference. First operand has 61 places, 70 transitions, 512 flow. Second operand 14 states and 186 transitions. [2025-04-13 19:35:20,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 172 transitions, 1466 flow [2025-04-13 19:35:20,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 172 transitions, 1376 flow, removed 45 selfloop flow, removed 3 redundant places. [2025-04-13 19:35:20,400 INFO L231 Difference]: Finished difference. Result has 77 places, 106 transitions, 981 flow [2025-04-13 19:35:20,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=981, PETRI_PLACES=77, PETRI_TRANSITIONS=106} [2025-04-13 19:35:20,400 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 42 predicate places. [2025-04-13 19:35:20,400 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 106 transitions, 981 flow [2025-04-13 19:35:20,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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:35:20,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:20,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:20,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:35:20,401 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:20,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:20,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1037891531, now seen corresponding path program 1 times [2025-04-13 19:35:20,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:20,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696867235] [2025-04-13 19:35:20,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:20,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:20,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:35:20,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:35:20,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:20,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:22,295 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:35:22,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:22,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696867235] [2025-04-13 19:35:22,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696867235] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:22,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:22,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 19:35:22,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609994369] [2025-04-13 19:35:22,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:22,296 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 19:35:22,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:22,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 19:35:22,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:35:22,302 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2025-04-13 19:35:22,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 106 transitions, 981 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:35:22,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:22,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2025-04-13 19:35:22,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:22,787 INFO L116 PetriNetUnfolderBase]: 672/1243 cut-off events. [2025-04-13 19:35:22,787 INFO L117 PetriNetUnfolderBase]: For 4045/4047 co-relation queries the response was YES. [2025-04-13 19:35:22,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5435 conditions, 1243 events. 672/1243 cut-off events. For 4045/4047 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6858 event pairs, 149 based on Foata normal form. 22/1259 useless extension candidates. Maximal degree in co-relation 5400. Up to 597 conditions per place. [2025-04-13 19:35:22,796 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 85 selfloop transitions, 27 changer transitions 8/127 dead transitions. [2025-04-13 19:35:22,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 127 transitions, 1329 flow [2025-04-13 19:35:22,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:35:22,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:35:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2025-04-13 19:35:22,797 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2025-04-13 19:35:22,797 INFO L175 Difference]: Start difference. First operand has 77 places, 106 transitions, 981 flow. Second operand 7 states and 99 transitions. [2025-04-13 19:35:22,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 127 transitions, 1329 flow [2025-04-13 19:35:22,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 127 transitions, 1299 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-04-13 19:35:22,814 INFO L231 Difference]: Finished difference. Result has 83 places, 106 transitions, 1037 flow [2025-04-13 19:35:22,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1037, PETRI_PLACES=83, PETRI_TRANSITIONS=106} [2025-04-13 19:35:22,814 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 48 predicate places. [2025-04-13 19:35:22,814 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 106 transitions, 1037 flow [2025-04-13 19:35:22,814 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:35:22,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:22,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:22,815 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:35:22,815 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:22,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:22,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1372370606, now seen corresponding path program 1 times [2025-04-13 19:35:22,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:22,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157440865] [2025-04-13 19:35:22,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:22,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:22,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:35:22,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:35:22,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:22,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:23,707 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:35:23,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:23,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157440865] [2025-04-13 19:35:23,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157440865] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:23,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:23,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 19:35:23,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965485237] [2025-04-13 19:35:23,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:23,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 19:35:23,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:23,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 19:35:23,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 19:35:23,719 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2025-04-13 19:35:23,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 106 transitions, 1037 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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:35:23,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:23,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2025-04-13 19:35:23,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:24,375 INFO L116 PetriNetUnfolderBase]: 1053/1814 cut-off events. [2025-04-13 19:35:24,376 INFO L117 PetriNetUnfolderBase]: For 6966/6966 co-relation queries the response was YES. [2025-04-13 19:35:24,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8070 conditions, 1814 events. 1053/1814 cut-off events. For 6966/6966 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 9926 event pairs, 86 based on Foata normal form. 20/1834 useless extension candidates. Maximal degree in co-relation 8031. Up to 911 conditions per place. [2025-04-13 19:35:24,387 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 119 selfloop transitions, 41 changer transitions 26/189 dead transitions. [2025-04-13 19:35:24,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 189 transitions, 1956 flow [2025-04-13 19:35:24,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 19:35:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 19:35:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2025-04-13 19:35:24,388 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49 [2025-04-13 19:35:24,388 INFO L175 Difference]: Start difference. First operand has 83 places, 106 transitions, 1037 flow. Second operand 10 states and 147 transitions. [2025-04-13 19:35:24,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 189 transitions, 1956 flow [2025-04-13 19:35:24,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 189 transitions, 1880 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-04-13 19:35:24,410 INFO L231 Difference]: Finished difference. Result has 87 places, 117 transitions, 1245 flow [2025-04-13 19:35:24,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1245, PETRI_PLACES=87, PETRI_TRANSITIONS=117} [2025-04-13 19:35:24,411 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 52 predicate places. [2025-04-13 19:35:24,411 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 117 transitions, 1245 flow [2025-04-13 19:35:24,411 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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:35:24,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:24,411 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:24,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:35:24,411 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:24,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:24,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1687907368, now seen corresponding path program 2 times [2025-04-13 19:35:24,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:24,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126182429] [2025-04-13 19:35:24,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:35:24,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:24,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:35:24,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:35:24,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:35:24,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:25,057 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:35:25,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:25,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126182429] [2025-04-13 19:35:25,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126182429] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:25,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:25,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:35:25,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848251809] [2025-04-13 19:35:25,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:25,058 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:35:25,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:25,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:35:25,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:35:25,062 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2025-04-13 19:35:25,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 117 transitions, 1245 flow. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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:35:25,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:25,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2025-04-13 19:35:25,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:25,504 INFO L116 PetriNetUnfolderBase]: 717/1361 cut-off events. [2025-04-13 19:35:25,504 INFO L117 PetriNetUnfolderBase]: For 6300/6301 co-relation queries the response was YES. [2025-04-13 19:35:25,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6512 conditions, 1361 events. 717/1361 cut-off events. For 6300/6301 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8027 event pairs, 92 based on Foata normal form. 13/1365 useless extension candidates. Maximal degree in co-relation 6472. Up to 863 conditions per place. [2025-04-13 19:35:25,514 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 122 selfloop transitions, 34 changer transitions 13/176 dead transitions. [2025-04-13 19:35:25,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 176 transitions, 1962 flow [2025-04-13 19:35:25,515 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 19:35:25,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 19:35:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions. [2025-04-13 19:35:25,515 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 19:35:25,515 INFO L175 Difference]: Start difference. First operand has 87 places, 117 transitions, 1245 flow. Second operand 10 states and 150 transitions. [2025-04-13 19:35:25,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 176 transitions, 1962 flow [2025-04-13 19:35:25,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 176 transitions, 1922 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-04-13 19:35:25,536 INFO L231 Difference]: Finished difference. Result has 93 places, 122 transitions, 1367 flow [2025-04-13 19:35:25,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1367, PETRI_PLACES=93, PETRI_TRANSITIONS=122} [2025-04-13 19:35:25,537 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 58 predicate places. [2025-04-13 19:35:25,537 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 122 transitions, 1367 flow [2025-04-13 19:35:25,537 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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:35:25,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:25,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:25,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:35:25,537 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:25,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:25,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1472932800, now seen corresponding path program 3 times [2025-04-13 19:35:25,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:25,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284685742] [2025-04-13 19:35:25,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:35:25,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:25,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:35:25,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:35:25,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:35:25,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:26,226 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:35:26,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:26,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284685742] [2025-04-13 19:35:26,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284685742] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:26,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:26,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:35:26,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631196986] [2025-04-13 19:35:26,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:26,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:35:26,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:26,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:35:26,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:35:26,230 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2025-04-13 19:35:26,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 122 transitions, 1367 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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:35:26,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:26,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2025-04-13 19:35:26,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:26,702 INFO L116 PetriNetUnfolderBase]: 711/1346 cut-off events. [2025-04-13 19:35:26,702 INFO L117 PetriNetUnfolderBase]: For 6053/6054 co-relation queries the response was YES. [2025-04-13 19:35:26,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6672 conditions, 1346 events. 711/1346 cut-off events. For 6053/6054 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7906 event pairs, 67 based on Foata normal form. 12/1349 useless extension candidates. Maximal degree in co-relation 6629. Up to 914 conditions per place. [2025-04-13 19:35:26,711 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 105 selfloop transitions, 38 changer transitions 10/160 dead transitions. [2025-04-13 19:35:26,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 160 transitions, 1927 flow [2025-04-13 19:35:26,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:35:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:35:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2025-04-13 19:35:26,713 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2025-04-13 19:35:26,713 INFO L175 Difference]: Start difference. First operand has 93 places, 122 transitions, 1367 flow. Second operand 9 states and 132 transitions. [2025-04-13 19:35:26,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 160 transitions, 1927 flow [2025-04-13 19:35:26,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 160 transitions, 1888 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-13 19:35:26,731 INFO L231 Difference]: Finished difference. Result has 100 places, 130 transitions, 1540 flow [2025-04-13 19:35:26,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1540, PETRI_PLACES=100, PETRI_TRANSITIONS=130} [2025-04-13 19:35:26,731 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 65 predicate places. [2025-04-13 19:35:26,731 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 130 transitions, 1540 flow [2025-04-13 19:35:26,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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:35:26,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:26,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:26,732 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:35:26,732 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:26,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:26,732 INFO L85 PathProgramCache]: Analyzing trace with hash 658187570, now seen corresponding path program 4 times [2025-04-13 19:35:26,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:26,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131006881] [2025-04-13 19:35:26,732 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:35:26,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:26,739 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:35:26,762 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:35:26,762 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:35:26,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:27,380 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:35:27,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:27,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131006881] [2025-04-13 19:35:27,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131006881] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:27,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:27,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:35:27,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706943429] [2025-04-13 19:35:27,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:27,381 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:35:27,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:27,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:35:27,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:35:27,387 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2025-04-13 19:35:27,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 130 transitions, 1540 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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:35:27,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:27,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2025-04-13 19:35:27,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:27,781 INFO L116 PetriNetUnfolderBase]: 721/1378 cut-off events. [2025-04-13 19:35:27,781 INFO L117 PetriNetUnfolderBase]: For 7908/7913 co-relation queries the response was YES. [2025-04-13 19:35:27,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7155 conditions, 1378 events. 721/1378 cut-off events. For 7908/7913 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 8158 event pairs, 94 based on Foata normal form. 20/1387 useless extension candidates. Maximal degree in co-relation 7110. Up to 772 conditions per place. [2025-04-13 19:35:27,791 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 85 selfloop transitions, 51 changer transitions 11/154 dead transitions. [2025-04-13 19:35:27,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 154 transitions, 2034 flow [2025-04-13 19:35:27,793 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:35:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:35:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2025-04-13 19:35:27,793 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-04-13 19:35:27,793 INFO L175 Difference]: Start difference. First operand has 100 places, 130 transitions, 1540 flow. Second operand 7 states and 100 transitions. [2025-04-13 19:35:27,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 154 transitions, 2034 flow [2025-04-13 19:35:27,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 154 transitions, 1971 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-04-13 19:35:27,814 INFO L231 Difference]: Finished difference. Result has 103 places, 132 transitions, 1683 flow [2025-04-13 19:35:27,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1477, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1683, PETRI_PLACES=103, PETRI_TRANSITIONS=132} [2025-04-13 19:35:27,817 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 68 predicate places. [2025-04-13 19:35:27,817 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 132 transitions, 1683 flow [2025-04-13 19:35:27,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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:35:27,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:27,817 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:27,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 19:35:27,817 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:27,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:27,818 INFO L85 PathProgramCache]: Analyzing trace with hash -420180356, now seen corresponding path program 5 times [2025-04-13 19:35:27,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:27,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835040333] [2025-04-13 19:35:27,818 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:35:27,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:27,826 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:35:27,845 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:35:27,845 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:35:27,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:28,315 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:35:28,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:28,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835040333] [2025-04-13 19:35:28,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835040333] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:28,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:28,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:35:28,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845499762] [2025-04-13 19:35:28,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:28,316 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:35:28,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:28,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:35:28,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:35:28,319 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2025-04-13 19:35:28,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 132 transitions, 1683 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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:35:28,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:28,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2025-04-13 19:35:28,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:28,875 INFO L116 PetriNetUnfolderBase]: 1003/1952 cut-off events. [2025-04-13 19:35:28,875 INFO L117 PetriNetUnfolderBase]: For 14451/14452 co-relation queries the response was YES. [2025-04-13 19:35:28,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10875 conditions, 1952 events. 1003/1952 cut-off events. For 14451/14452 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 13045 event pairs, 219 based on Foata normal form. 13/1951 useless extension candidates. Maximal degree in co-relation 10828. Up to 738 conditions per place. [2025-04-13 19:35:28,887 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 127 selfloop transitions, 39 changer transitions 51/224 dead transitions. [2025-04-13 19:35:28,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 224 transitions, 3244 flow [2025-04-13 19:35:28,887 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:35:28,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:35:28,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2025-04-13 19:35:28,888 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-04-13 19:35:28,888 INFO L175 Difference]: Start difference. First operand has 103 places, 132 transitions, 1683 flow. Second operand 7 states and 110 transitions. [2025-04-13 19:35:28,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 224 transitions, 3244 flow [2025-04-13 19:35:28,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 224 transitions, 3127 flow, removed 34 selfloop flow, removed 7 redundant places. [2025-04-13 19:35:28,927 INFO L231 Difference]: Finished difference. Result has 104 places, 144 transitions, 1956 flow [2025-04-13 19:35:28,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1616, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1956, PETRI_PLACES=104, PETRI_TRANSITIONS=144} [2025-04-13 19:35:28,927 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 69 predicate places. [2025-04-13 19:35:28,927 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 144 transitions, 1956 flow [2025-04-13 19:35:28,927 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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:35:28,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:28,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:28,928 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 19:35:28,928 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:28,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:28,928 INFO L85 PathProgramCache]: Analyzing trace with hash -940583242, now seen corresponding path program 6 times [2025-04-13 19:35:28,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:28,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484448024] [2025-04-13 19:35:28,928 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:35:28,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:28,935 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:35:28,948 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:35:28,949 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:35:28,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:29,497 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:35:29,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:29,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484448024] [2025-04-13 19:35:29,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484448024] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:29,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:29,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:35:29,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869918625] [2025-04-13 19:35:29,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:29,497 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:35:29,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:29,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:35:29,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:35:29,499 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2025-04-13 19:35:29,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 144 transitions, 1956 flow. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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:35:29,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:29,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2025-04-13 19:35:29,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:29,994 INFO L116 PetriNetUnfolderBase]: 824/1609 cut-off events. [2025-04-13 19:35:29,994 INFO L117 PetriNetUnfolderBase]: For 13439/13446 co-relation queries the response was YES. [2025-04-13 19:35:29,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9001 conditions, 1609 events. 824/1609 cut-off events. For 13439/13446 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10183 event pairs, 160 based on Foata normal form. 13/1603 useless extension candidates. Maximal degree in co-relation 8955. Up to 1001 conditions per place. [2025-04-13 19:35:30,004 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 95 selfloop transitions, 51 changer transitions 30/183 dead transitions. [2025-04-13 19:35:30,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 183 transitions, 2663 flow [2025-04-13 19:35:30,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:35:30,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:35:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2025-04-13 19:35:30,005 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4925925925925926 [2025-04-13 19:35:30,005 INFO L175 Difference]: Start difference. First operand has 104 places, 144 transitions, 1956 flow. Second operand 9 states and 133 transitions. [2025-04-13 19:35:30,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 183 transitions, 2663 flow [2025-04-13 19:35:30,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 183 transitions, 2596 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-04-13 19:35:30,030 INFO L231 Difference]: Finished difference. Result has 109 places, 137 transitions, 2028 flow [2025-04-13 19:35:30,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2028, PETRI_PLACES=109, PETRI_TRANSITIONS=137} [2025-04-13 19:35:30,031 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 74 predicate places. [2025-04-13 19:35:30,031 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 137 transitions, 2028 flow [2025-04-13 19:35:30,031 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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:35:30,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:30,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:30,031 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 19:35:30,031 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:30,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:30,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1512630638, now seen corresponding path program 7 times [2025-04-13 19:35:30,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:30,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106566345] [2025-04-13 19:35:30,032 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:35:30,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:30,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:35:30,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:35:30,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:30,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:30,659 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:35:30,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:30,660 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106566345] [2025-04-13 19:35:30,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106566345] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:30,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:30,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:35:30,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334014443] [2025-04-13 19:35:30,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:30,660 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:35:30,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:30,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:35:30,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:35:30,667 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2025-04-13 19:35:30,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 137 transitions, 2028 flow. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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:35:30,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:30,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2025-04-13 19:35:30,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:31,187 INFO L116 PetriNetUnfolderBase]: 1022/1838 cut-off events. [2025-04-13 19:35:31,188 INFO L117 PetriNetUnfolderBase]: For 17283/17289 co-relation queries the response was YES. [2025-04-13 19:35:31,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10336 conditions, 1838 events. 1022/1838 cut-off events. For 17283/17289 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10611 event pairs, 245 based on Foata normal form. 16/1853 useless extension candidates. Maximal degree in co-relation 10289. Up to 1431 conditions per place. [2025-04-13 19:35:31,197 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 98 selfloop transitions, 56 changer transitions 15/172 dead transitions. [2025-04-13 19:35:31,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 172 transitions, 2588 flow [2025-04-13 19:35:31,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:35:31,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:35:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2025-04-13 19:35:31,198 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-04-13 19:35:31,198 INFO L175 Difference]: Start difference. First operand has 109 places, 137 transitions, 2028 flow. Second operand 9 states and 120 transitions. [2025-04-13 19:35:31,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 172 transitions, 2588 flow [2025-04-13 19:35:31,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 172 transitions, 2502 flow, removed 26 selfloop flow, removed 7 redundant places. [2025-04-13 19:35:31,226 INFO L231 Difference]: Finished difference. Result has 109 places, 136 transitions, 2077 flow [2025-04-13 19:35:31,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1954, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2077, PETRI_PLACES=109, PETRI_TRANSITIONS=136} [2025-04-13 19:35:31,226 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 74 predicate places. [2025-04-13 19:35:31,227 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 136 transitions, 2077 flow [2025-04-13 19:35:31,227 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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:35:31,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:31,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:31,227 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 19:35:31,227 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:31,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:31,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1214964310, now seen corresponding path program 8 times [2025-04-13 19:35:31,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:31,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370321060] [2025-04-13 19:35:31,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:35:31,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:31,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:35:31,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:35:31,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:35:31,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:31,645 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:35:31,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:31,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370321060] [2025-04-13 19:35:31,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370321060] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:31,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:31,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 19:35:31,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496874112] [2025-04-13 19:35:31,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:31,648 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 19:35:31,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:31,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 19:35:31,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:35:31,658 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2025-04-13 19:35:31,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 136 transitions, 2077 flow. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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:35:31,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:31,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2025-04-13 19:35:31,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:32,330 INFO L116 PetriNetUnfolderBase]: 1082/1947 cut-off events. [2025-04-13 19:35:32,331 INFO L117 PetriNetUnfolderBase]: For 16237/16237 co-relation queries the response was YES. [2025-04-13 19:35:32,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10851 conditions, 1947 events. 1082/1947 cut-off events. For 16237/16237 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11385 event pairs, 254 based on Foata normal form. 16/1963 useless extension candidates. Maximal degree in co-relation 10806. Up to 1403 conditions per place. [2025-04-13 19:35:32,347 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 120 selfloop transitions, 50 changer transitions 33/206 dead transitions. [2025-04-13 19:35:32,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 206 transitions, 3040 flow [2025-04-13 19:35:32,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 19:35:32,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 19:35:32,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 162 transitions. [2025-04-13 19:35:32,348 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4153846153846154 [2025-04-13 19:35:32,349 INFO L175 Difference]: Start difference. First operand has 109 places, 136 transitions, 2077 flow. Second operand 13 states and 162 transitions. [2025-04-13 19:35:32,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 206 transitions, 3040 flow [2025-04-13 19:35:32,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 206 transitions, 2992 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-04-13 19:35:32,378 INFO L231 Difference]: Finished difference. Result has 119 places, 140 transitions, 2215 flow [2025-04-13 19:35:32,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2033, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2215, PETRI_PLACES=119, PETRI_TRANSITIONS=140} [2025-04-13 19:35:32,378 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 84 predicate places. [2025-04-13 19:35:32,378 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 140 transitions, 2215 flow [2025-04-13 19:35:32,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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:35:32,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:32,378 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:32,379 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 19:35:32,379 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:32,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:32,379 INFO L85 PathProgramCache]: Analyzing trace with hash -956741336, now seen corresponding path program 9 times [2025-04-13 19:35:32,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:32,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204638562] [2025-04-13 19:35:32,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:35:32,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:32,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:35:32,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:35:32,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:35:32,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:32,690 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:35:32,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:32,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204638562] [2025-04-13 19:35:32,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204638562] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:32,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:32,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:35:32,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017128547] [2025-04-13 19:35:32,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:32,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:35:32,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:32,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:35:32,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:35:32,691 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-04-13 19:35:32,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 140 transitions, 2215 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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:35:32,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:32,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-04-13 19:35:32,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:33,030 INFO L116 PetriNetUnfolderBase]: 727/1470 cut-off events. [2025-04-13 19:35:33,030 INFO L117 PetriNetUnfolderBase]: For 14968/14992 co-relation queries the response was YES. [2025-04-13 19:35:33,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8636 conditions, 1470 events. 727/1470 cut-off events. For 14968/14992 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9423 event pairs, 228 based on Foata normal form. 34/1488 useless extension candidates. Maximal degree in co-relation 8588. Up to 835 conditions per place. [2025-04-13 19:35:33,036 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 87 selfloop transitions, 24 changer transitions 40/164 dead transitions. [2025-04-13 19:35:33,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 164 transitions, 2772 flow [2025-04-13 19:35:33,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:35:33,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:35:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-04-13 19:35:33,037 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.56 [2025-04-13 19:35:33,037 INFO L175 Difference]: Start difference. First operand has 119 places, 140 transitions, 2215 flow. Second operand 5 states and 84 transitions. [2025-04-13 19:35:33,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 164 transitions, 2772 flow [2025-04-13 19:35:33,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 164 transitions, 2652 flow, removed 31 selfloop flow, removed 9 redundant places. [2025-04-13 19:35:33,057 INFO L231 Difference]: Finished difference. Result has 114 places, 119 transitions, 1834 flow [2025-04-13 19:35:33,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2107, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1834, PETRI_PLACES=114, PETRI_TRANSITIONS=119} [2025-04-13 19:35:33,057 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 79 predicate places. [2025-04-13 19:35:33,057 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 119 transitions, 1834 flow [2025-04-13 19:35:33,057 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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:35:33,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:33,057 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:33,057 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 19:35:33,057 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:33,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:33,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2080406454, now seen corresponding path program 10 times [2025-04-13 19:35:33,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:33,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143714041] [2025-04-13 19:35:33,058 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:35:33,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:33,066 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:35:33,089 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:35:33,089 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:35:33,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:33,818 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:35:33,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:33,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143714041] [2025-04-13 19:35:33,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143714041] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:33,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:33,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:35:33,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975985491] [2025-04-13 19:35:33,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:33,819 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:35:33,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:33,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:35:33,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:35:33,819 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2025-04-13 19:35:33,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 119 transitions, 1834 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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:35:33,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:33,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2025-04-13 19:35:33,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:34,377 INFO L116 PetriNetUnfolderBase]: 603/1233 cut-off events. [2025-04-13 19:35:34,377 INFO L117 PetriNetUnfolderBase]: For 11394/11395 co-relation queries the response was YES. [2025-04-13 19:35:34,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7031 conditions, 1233 events. 603/1233 cut-off events. For 11394/11395 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7516 event pairs, 109 based on Foata normal form. 29/1254 useless extension candidates. Maximal degree in co-relation 6984. Up to 467 conditions per place. [2025-04-13 19:35:34,383 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 77 selfloop transitions, 47 changer transitions 33/164 dead transitions. [2025-04-13 19:35:34,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 164 transitions, 2521 flow [2025-04-13 19:35:34,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:35:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:35:34,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 156 transitions. [2025-04-13 19:35:34,384 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2025-04-13 19:35:34,384 INFO L175 Difference]: Start difference. First operand has 114 places, 119 transitions, 1834 flow. Second operand 11 states and 156 transitions. [2025-04-13 19:35:34,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 164 transitions, 2521 flow [2025-04-13 19:35:34,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 164 transitions, 2274 flow, removed 32 selfloop flow, removed 9 redundant places. [2025-04-13 19:35:34,402 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 1557 flow [2025-04-13 19:35:34,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1619, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1557, PETRI_PLACES=118, PETRI_TRANSITIONS=108} [2025-04-13 19:35:34,403 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 83 predicate places. [2025-04-13 19:35:34,403 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 1557 flow [2025-04-13 19:35:34,403 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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:35:34,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:34,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:34,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 19:35:34,403 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:34,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:34,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1544861038, now seen corresponding path program 1 times [2025-04-13 19:35:34,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:34,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316228631] [2025-04-13 19:35:34,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:34,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:34,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:35:34,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:35:34,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:34,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:35,116 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:35:35,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:35,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316228631] [2025-04-13 19:35:35,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316228631] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:35,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:35,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 19:35:35,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316080018] [2025-04-13 19:35:35,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:35,117 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 19:35:35,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:35,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 19:35:35,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:35:35,118 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2025-04-13 19:35:35,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 108 transitions, 1557 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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:35:35,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:35,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2025-04-13 19:35:35,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:35,646 INFO L116 PetriNetUnfolderBase]: 546/1110 cut-off events. [2025-04-13 19:35:35,646 INFO L117 PetriNetUnfolderBase]: For 8933/8934 co-relation queries the response was YES. [2025-04-13 19:35:35,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6055 conditions, 1110 events. 546/1110 cut-off events. For 8933/8934 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6534 event pairs, 103 based on Foata normal form. 12/1114 useless extension candidates. Maximal degree in co-relation 6007. Up to 564 conditions per place. [2025-04-13 19:35:35,651 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 95 selfloop transitions, 30 changer transitions 31/161 dead transitions. [2025-04-13 19:35:35,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 161 transitions, 2244 flow [2025-04-13 19:35:35,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:35:35,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:35:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 163 transitions. [2025-04-13 19:35:35,652 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49393939393939396 [2025-04-13 19:35:35,653 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 1557 flow. Second operand 11 states and 163 transitions. [2025-04-13 19:35:35,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 161 transitions, 2244 flow [2025-04-13 19:35:35,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 161 transitions, 2115 flow, removed 31 selfloop flow, removed 11 redundant places. [2025-04-13 19:35:35,670 INFO L231 Difference]: Finished difference. Result has 118 places, 103 transitions, 1474 flow [2025-04-13 19:35:35,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1474, PETRI_PLACES=118, PETRI_TRANSITIONS=103} [2025-04-13 19:35:35,671 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 83 predicate places. [2025-04-13 19:35:35,671 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 103 transitions, 1474 flow [2025-04-13 19:35:35,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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:35:35,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:35,671 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:35,671 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 19:35:35,671 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:35,671 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:35,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1939933144, now seen corresponding path program 1 times [2025-04-13 19:35:35,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:35,672 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869076873] [2025-04-13 19:35:35,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:35,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:35,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:35:35,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:35:35,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:35,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:36,294 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:35:36,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:36,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869076873] [2025-04-13 19:35:36,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869076873] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:36,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:36,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:35:36,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615999568] [2025-04-13 19:35:36,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:36,295 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:35:36,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:36,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:35:36,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:35:36,306 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2025-04-13 19:35:36,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 103 transitions, 1474 flow. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:35:36,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:36,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2025-04-13 19:35:36,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:36,719 INFO L116 PetriNetUnfolderBase]: 642/1178 cut-off events. [2025-04-13 19:35:36,719 INFO L117 PetriNetUnfolderBase]: For 9705/9707 co-relation queries the response was YES. [2025-04-13 19:35:36,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6338 conditions, 1178 events. 642/1178 cut-off events. For 9705/9707 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6043 event pairs, 176 based on Foata normal form. 15/1193 useless extension candidates. Maximal degree in co-relation 6291. Up to 657 conditions per place. [2025-04-13 19:35:36,726 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 73 selfloop transitions, 38 changer transitions 30/144 dead transitions. [2025-04-13 19:35:36,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 144 transitions, 2048 flow [2025-04-13 19:35:36,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:35:36,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:35:36,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2025-04-13 19:35:36,727 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2025-04-13 19:35:36,727 INFO L175 Difference]: Start difference. First operand has 118 places, 103 transitions, 1474 flow. Second operand 9 states and 116 transitions. [2025-04-13 19:35:36,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 144 transitions, 2048 flow [2025-04-13 19:35:36,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 144 transitions, 1918 flow, removed 22 selfloop flow, removed 12 redundant places. [2025-04-13 19:35:36,747 INFO L231 Difference]: Finished difference. Result has 114 places, 95 transitions, 1342 flow [2025-04-13 19:35:36,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1342, PETRI_PLACES=114, PETRI_TRANSITIONS=95} [2025-04-13 19:35:36,747 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 79 predicate places. [2025-04-13 19:35:36,747 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 95 transitions, 1342 flow [2025-04-13 19:35:36,747 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:35:36,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:36,748 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:36,748 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 19:35:36,748 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:36,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:36,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1209704406, now seen corresponding path program 2 times [2025-04-13 19:35:36,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:36,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333652347] [2025-04-13 19:35:36,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:35:36,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:36,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:35:36,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:35:36,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:35:36,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:37,452 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:35:37,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:37,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333652347] [2025-04-13 19:35:37,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333652347] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:37,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:37,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:35:37,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306064356] [2025-04-13 19:35:37,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:37,453 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:35:37,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:37,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:35:37,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:35:37,464 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2025-04-13 19:35:37,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 95 transitions, 1342 flow. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:35:37,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:37,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2025-04-13 19:35:37,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:37,939 INFO L116 PetriNetUnfolderBase]: 542/1014 cut-off events. [2025-04-13 19:35:37,940 INFO L117 PetriNetUnfolderBase]: For 8042/8044 co-relation queries the response was YES. [2025-04-13 19:35:37,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5346 conditions, 1014 events. 542/1014 cut-off events. For 8042/8044 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5117 event pairs, 140 based on Foata normal form. 15/1029 useless extension candidates. Maximal degree in co-relation 5303. Up to 612 conditions per place. [2025-04-13 19:35:37,945 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 71 selfloop transitions, 35 changer transitions 19/128 dead transitions. [2025-04-13 19:35:37,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 128 transitions, 1776 flow [2025-04-13 19:35:37,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:35:37,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:35:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2025-04-13 19:35:37,946 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2025-04-13 19:35:37,946 INFO L175 Difference]: Start difference. First operand has 114 places, 95 transitions, 1342 flow. Second operand 9 states and 115 transitions. [2025-04-13 19:35:37,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 128 transitions, 1776 flow [2025-04-13 19:35:37,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 128 transitions, 1682 flow, removed 13 selfloop flow, removed 9 redundant places. [2025-04-13 19:35:37,960 INFO L231 Difference]: Finished difference. Result has 114 places, 90 transitions, 1288 flow [2025-04-13 19:35:37,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1288, PETRI_PLACES=114, PETRI_TRANSITIONS=90} [2025-04-13 19:35:37,960 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 79 predicate places. [2025-04-13 19:35:37,960 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 90 transitions, 1288 flow [2025-04-13 19:35:37,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:35:37,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:37,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:37,961 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 19:35:37,961 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:37,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:37,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1780113182, now seen corresponding path program 3 times [2025-04-13 19:35:37,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:37,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843831485] [2025-04-13 19:35:37,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:35:37,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:37,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:35:37,981 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:35:37,981 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:35:37,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:38,417 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:35:38,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:38,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843831485] [2025-04-13 19:35:38,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843831485] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:38,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:38,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:35:38,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851200120] [2025-04-13 19:35:38,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:38,418 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:35:38,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:38,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:35:38,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:35:38,418 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-04-13 19:35:38,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 90 transitions, 1288 flow. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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:35:38,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:38,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-04-13 19:35:38,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:38,679 INFO L116 PetriNetUnfolderBase]: 381/804 cut-off events. [2025-04-13 19:35:38,679 INFO L117 PetriNetUnfolderBase]: For 6993/7005 co-relation queries the response was YES. [2025-04-13 19:35:38,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4408 conditions, 804 events. 381/804 cut-off events. For 6993/7005 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4537 event pairs, 147 based on Foata normal form. 20/812 useless extension candidates. Maximal degree in co-relation 4365. Up to 577 conditions per place. [2025-04-13 19:35:38,683 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 55 selfloop transitions, 22 changer transitions 14/100 dead transitions. [2025-04-13 19:35:38,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 100 transitions, 1527 flow [2025-04-13 19:35:38,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:35:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:35:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2025-04-13 19:35:38,684 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-04-13 19:35:38,684 INFO L175 Difference]: Start difference. First operand has 114 places, 90 transitions, 1288 flow. Second operand 6 states and 87 transitions. [2025-04-13 19:35:38,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 100 transitions, 1527 flow [2025-04-13 19:35:38,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 100 transitions, 1439 flow, removed 10 selfloop flow, removed 8 redundant places. [2025-04-13 19:35:38,695 INFO L231 Difference]: Finished difference. Result has 112 places, 82 transitions, 1131 flow [2025-04-13 19:35:38,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1131, PETRI_PLACES=112, PETRI_TRANSITIONS=82} [2025-04-13 19:35:38,695 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 77 predicate places. [2025-04-13 19:35:38,695 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 82 transitions, 1131 flow [2025-04-13 19:35:38,695 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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:35:38,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:38,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:38,695 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 19:35:38,696 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:35:38,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash 793953132, now seen corresponding path program 1 times [2025-04-13 19:35:38,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:38,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865346595] [2025-04-13 19:35:38,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:38,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:38,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 19:35:38,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:35:38,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:38,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:39,728 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:35:39,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:39,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865346595] [2025-04-13 19:35:39,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865346595] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:39,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:39,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:35:39,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525355518] [2025-04-13 19:35:39,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:39,728 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:35:39,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:39,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:35:39,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:35:39,733 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2025-04-13 19:35:39,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 82 transitions, 1131 flow. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 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:35:39,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:39,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2025-04-13 19:35:39,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:40,060 INFO L116 PetriNetUnfolderBase]: 381/772 cut-off events. [2025-04-13 19:35:40,060 INFO L117 PetriNetUnfolderBase]: For 5794/5794 co-relation queries the response was YES. [2025-04-13 19:35:40,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4194 conditions, 772 events. 381/772 cut-off events. For 5794/5794 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4155 event pairs, 107 based on Foata normal form. 6/775 useless extension candidates. Maximal degree in co-relation 4161. Up to 559 conditions per place. [2025-04-13 19:35:40,063 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 0 selfloop transitions, 0 changer transitions 96/96 dead transitions. [2025-04-13 19:35:40,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 96 transitions, 1338 flow [2025-04-13 19:35:40,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:35:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:35:40,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2025-04-13 19:35:40,064 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4125 [2025-04-13 19:35:40,064 INFO L175 Difference]: Start difference. First operand has 112 places, 82 transitions, 1131 flow. Second operand 8 states and 99 transitions. [2025-04-13 19:35:40,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 96 transitions, 1338 flow [2025-04-13 19:35:40,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 96 transitions, 1210 flow, removed 5 selfloop flow, removed 11 redundant places. [2025-04-13 19:35:40,074 INFO L231 Difference]: Finished difference. Result has 104 places, 0 transitions, 0 flow [2025-04-13 19:35:40,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=104, PETRI_TRANSITIONS=0} [2025-04-13 19:35:40,075 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 69 predicate places. [2025-04-13 19:35:40,075 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 0 transitions, 0 flow [2025-04-13 19:35:40,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 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:35:40,077 INFO L790 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 19:35:40,077 INFO L790 garLoopResultBuilder]: Registering result SAFE for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 19:35:40,077 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-04-13 19:35:40,077 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 19:35:40,077 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-13 19:35:40,077 INFO L790 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 19:35:40,077 INFO L790 garLoopResultBuilder]: Registering result SAFE for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 19:35:40,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 19:35:40,078 INFO L422 BasicCegarLoop]: Path program histogram: [10, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:40,081 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:35:40,081 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:35:40,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:35:40 BasicIcfg [2025-04-13 19:35:40,085 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:35:40,086 INFO L158 Benchmark]: Toolchain (without parser) took 29674.59ms. Allocated memory was 155.2MB in the beginning and 826.3MB in the end (delta: 671.1MB). Free memory was 108.1MB in the beginning and 551.9MB in the end (delta: -443.8MB). Peak memory consumption was 225.8MB. Max. memory is 8.0GB. [2025-04-13 19:35:40,086 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 163.6MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:35:40,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.62ms. Allocated memory is still 155.2MB. Free memory was 108.1MB in the beginning and 77.3MB in the end (delta: 30.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 19:35:40,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.78ms. Allocated memory is still 155.2MB. Free memory was 77.3MB in the beginning and 73.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:35:40,086 INFO L158 Benchmark]: Boogie Preprocessor took 47.43ms. Allocated memory is still 155.2MB. Free memory was 73.1MB in the beginning and 67.5MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-13 19:35:40,086 INFO L158 Benchmark]: RCFGBuilder took 774.88ms. Allocated memory is still 155.2MB. Free memory was 67.5MB in the beginning and 101.3MB in the end (delta: -33.8MB). Peak memory consumption was 49.9MB. Max. memory is 8.0GB. [2025-04-13 19:35:40,087 INFO L158 Benchmark]: TraceAbstraction took 28295.11ms. Allocated memory was 155.2MB in the beginning and 826.3MB in the end (delta: 671.1MB). Free memory was 100.2MB in the beginning and 551.9MB in the end (delta: -451.7MB). Peak memory consumption was 216.3MB. Max. memory is 8.0GB. [2025-04-13 19:35:40,087 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.21ms. Allocated memory is still 163.6MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 514.62ms. Allocated memory is still 155.2MB. Free memory was 108.1MB in the beginning and 77.3MB in the end (delta: 30.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.78ms. Allocated memory is still 155.2MB. Free memory was 77.3MB in the beginning and 73.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.43ms. Allocated memory is still 155.2MB. Free memory was 73.1MB in the beginning and 67.5MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 774.88ms. Allocated memory is still 155.2MB. Free memory was 67.5MB in the beginning and 101.3MB in the end (delta: -33.8MB). Peak memory consumption was 49.9MB. Max. memory is 8.0GB. * TraceAbstraction took 28295.11ms. Allocated memory was 155.2MB in the beginning and 826.3MB in the end (delta: 671.1MB). Free memory was 100.2MB in the beginning and 551.9MB in the end (delta: -451.7MB). Peak memory consumption was 216.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: 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 5 procedures, 52 locations, 49 edges, 7 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: 28.2s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1221 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1182 mSDsluCounter, 669 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 559 mSDsCounter, 474 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3871 IncrementalHoareTripleChecker+Invalid, 4345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 474 mSolverCounterUnsat, 110 mSDtfsCounter, 3871 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2215occurred in iteration=16, InterpolantAutomatonStates: 192, 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.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 401 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 378 ConstructedInterpolants, 0 QuantifiedInterpolants, 5013 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 19:35:40,102 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...