./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label33.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aaccf385f935203878b819a92144fc9de308865fc678d0507ba69ad2b46a0a7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:01:52,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:01:52,155 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:01:52,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:01:52,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:01:52,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:01:52,180 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:01:52,180 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:01:52,181 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:01:52,181 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:01:52,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:01:52,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:01:52,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:01:52,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:01:52,182 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:01:52,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:01:52,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:01:52,183 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:01:52,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:01:52,183 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:01:52,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:01:52,183 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:01:52,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:01:52,183 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:01:52,183 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:01:52,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:01:52,183 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:01:52,183 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:01:52,183 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:01:52,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:01:52,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:01:52,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:01:52,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:01:52,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:01:52,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:01:52,184 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:01:52,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:01:52,184 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:01:52,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:01:52,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:01:52,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:01:52,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:01:52,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:01:52,184 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aaccf385f935203878b819a92144fc9de308865fc678d0507ba69ad2b46a0a7a [2025-03-16 15:01:52,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:01:52,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:01:52,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:01:52,422 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:01:52,422 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:01:52,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label33.c [2025-03-16 15:01:53,551 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b525e7b/92b222869c8945848114a2da57cc356c/FLAG2b099f067 [2025-03-16 15:01:54,061 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:01:54,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label33.c [2025-03-16 15:01:54,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b525e7b/92b222869c8945848114a2da57cc356c/FLAG2b099f067 [2025-03-16 15:01:54,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b525e7b/92b222869c8945848114a2da57cc356c [2025-03-16 15:01:54,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:01:54,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:01:54,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:01:54,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:01:54,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:01:54,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:01:54" (1/1) ... [2025-03-16 15:01:54,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@796055cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:54, skipping insertion in model container [2025-03-16 15:01:54,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:01:54" (1/1) ... [2025-03-16 15:01:54,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:01:54,377 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label33.c[5177,5190] [2025-03-16 15:01:54,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:01:54,867 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:01:54,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label33.c[5177,5190] [2025-03-16 15:01:55,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:01:55,191 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:01:55,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:55 WrapperNode [2025-03-16 15:01:55,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:01:55,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:01:55,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:01:55,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:01:55,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:55" (1/1) ... [2025-03-16 15:01:55,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:55" (1/1) ... [2025-03-16 15:01:55,663 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-16 15:01:55,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:01:55,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:01:55,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:01:55,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:01:55,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:55" (1/1) ... [2025-03-16 15:01:55,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:55" (1/1) ... [2025-03-16 15:01:55,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:55" (1/1) ... [2025-03-16 15:01:55,945 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-03-16 15:01:55,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:55" (1/1) ... [2025-03-16 15:01:55,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:55" (1/1) ... [2025-03-16 15:01:56,059 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:55" (1/1) ... [2025-03-16 15:01:56,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:55" (1/1) ... [2025-03-16 15:01:56,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:55" (1/1) ... [2025-03-16 15:01:56,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:55" (1/1) ... [2025-03-16 15:01:56,230 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:01:56,231 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:01:56,231 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:01:56,231 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:01:56,237 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:55" (1/1) ... [2025-03-16 15:01:56,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:01:56,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:01:56,269 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-03-16 15:01:56,280 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-03-16 15:01:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:01:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:01:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:01:56,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:01:56,366 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:01:56,367 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:02:00,452 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-16 15:02:00,452 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-16 15:02:00,453 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-16 15:02:00,599 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-16 15:02:00,599 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:02:00,626 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:02:00,631 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:02:00,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:02:00 BoogieIcfgContainer [2025-03-16 15:02:00,631 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:02:00,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:02:00,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:02:00,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:02:00,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:01:54" (1/3) ... [2025-03-16 15:02:00,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@619f1208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:02:00, skipping insertion in model container [2025-03-16 15:02:00,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:55" (2/3) ... [2025-03-16 15:02:00,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@619f1208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:02:00, skipping insertion in model container [2025-03-16 15:02:00,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:02:00" (3/3) ... [2025-03-16 15:02:00,640 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label33.c [2025-03-16 15:02:00,650 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:02:00,651 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label33.c that has 1 procedures, 1037 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:02:00,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:02:00,728 INFO L333 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;@4bc987c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:02:00,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:02:00,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 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-03-16 15:02:00,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 15:02:00,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:00,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:00,741 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:00,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:00,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1516614076, now seen corresponding path program 1 times [2025-03-16 15:02:00,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:00,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021276368] [2025-03-16 15:02:00,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:00,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:00,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 15:02:00,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 15:02:00,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:00,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:00,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:00,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021276368] [2025-03-16 15:02:00,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021276368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:00,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:00,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:00,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130296853] [2025-03-16 15:02:00,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:00,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:02:00,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:00,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:02:00,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:02:00,879 INFO L87 Difference]: Start difference. First operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 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) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-03-16 15:02:00,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:00,945 INFO L93 Difference]: Finished difference Result 2073 states and 3881 transitions. [2025-03-16 15:02:00,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:02:00,950 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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) Word has length 34 [2025-03-16 15:02:00,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:00,970 INFO L225 Difference]: With dead ends: 2073 [2025-03-16 15:02:00,970 INFO L226 Difference]: Without dead ends: 1034 [2025-03-16 15:02:00,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:02:00,981 INFO L435 NwaCegarLoop]: 1879 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:00,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:02:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-16 15:02:01,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2025-03-16 15:02:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 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-03-16 15:02:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2025-03-16 15:02:01,059 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 34 [2025-03-16 15:02:01,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:01,059 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2025-03-16 15:02:01,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-03-16 15:02:01,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2025-03-16 15:02:01,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 15:02:01,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:01,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:01,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:02:01,060 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:01,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:01,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1127369795, now seen corresponding path program 1 times [2025-03-16 15:02:01,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:01,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924579418] [2025-03-16 15:02:01,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:01,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:01,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 15:02:01,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 15:02:01,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:01,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:01,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:01,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924579418] [2025-03-16 15:02:01,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924579418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:01,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:01,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:01,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100270732] [2025-03-16 15:02:01,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:01,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:01,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:01,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:01,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:01,226 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 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-03-16 15:02:04,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:04,417 INFO L93 Difference]: Finished difference Result 2905 states and 5325 transitions. [2025-03-16 15:02:04,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:04,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 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) Word has length 34 [2025-03-16 15:02:04,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:04,424 INFO L225 Difference]: With dead ends: 2905 [2025-03-16 15:02:04,424 INFO L226 Difference]: Without dead ends: 1872 [2025-03-16 15:02:04,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:04,426 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 854 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 3243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:04,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1091 Invalid, 3243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [798 Valid, 2445 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-16 15:02:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2025-03-16 15:02:04,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1858. [2025-03-16 15:02:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 1.5444264943457189) internal successors, (2868), 1857 states have internal predecessors, (2868), 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-03-16 15:02:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2868 transitions. [2025-03-16 15:02:04,464 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2868 transitions. Word has length 34 [2025-03-16 15:02:04,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:04,464 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2868 transitions. [2025-03-16 15:02:04,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 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-03-16 15:02:04,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2868 transitions. [2025-03-16 15:02:04,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 15:02:04,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:04,466 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:04,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:02:04,466 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:04,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:04,467 INFO L85 PathProgramCache]: Analyzing trace with hash -807790200, now seen corresponding path program 1 times [2025-03-16 15:02:04,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:04,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761244324] [2025-03-16 15:02:04,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:04,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:04,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 15:02:04,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 15:02:04,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:04,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:04,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:04,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761244324] [2025-03-16 15:02:04,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761244324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:04,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:04,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:04,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486557299] [2025-03-16 15:02:04,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:04,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:04,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:04,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:04,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:04,706 INFO L87 Difference]: Start difference. First operand 1858 states and 2868 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:07,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:07,517 INFO L93 Difference]: Finished difference Result 5316 states and 8228 transitions. [2025-03-16 15:02:07,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:07,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-16 15:02:07,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:07,531 INFO L225 Difference]: With dead ends: 5316 [2025-03-16 15:02:07,532 INFO L226 Difference]: Without dead ends: 3459 [2025-03-16 15:02:07,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:07,535 INFO L435 NwaCegarLoop]: 1038 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:07,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1191 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 15:02:07,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3459 states. [2025-03-16 15:02:07,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3459 to 3458. [2025-03-16 15:02:07,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3458 states, 3457 states have (on average 1.380676887474689) internal successors, (4773), 3457 states have internal predecessors, (4773), 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-03-16 15:02:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4773 transitions. [2025-03-16 15:02:07,633 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 4773 transitions. Word has length 106 [2025-03-16 15:02:07,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:07,635 INFO L471 AbstractCegarLoop]: Abstraction has 3458 states and 4773 transitions. [2025-03-16 15:02:07,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:07,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4773 transitions. [2025-03-16 15:02:07,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-16 15:02:07,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:07,639 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:07,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:02:07,639 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:07,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:07,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1157607232, now seen corresponding path program 1 times [2025-03-16 15:02:07,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:07,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546879699] [2025-03-16 15:02:07,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:07,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:07,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 15:02:07,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 15:02:07,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:07,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:07,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:07,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546879699] [2025-03-16 15:02:07,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546879699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:07,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:07,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:07,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635165977] [2025-03-16 15:02:07,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:07,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:07,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:07,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:07,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:07,775 INFO L87 Difference]: Start difference. First operand 3458 states and 4773 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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-03-16 15:02:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:10,619 INFO L93 Difference]: Finished difference Result 10094 states and 13938 transitions. [2025-03-16 15:02:10,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:10,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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) Word has length 120 [2025-03-16 15:02:10,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:10,639 INFO L225 Difference]: With dead ends: 10094 [2025-03-16 15:02:10,639 INFO L226 Difference]: Without dead ends: 6637 [2025-03-16 15:02:10,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:10,645 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 932 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2551 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 3315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:10,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 902 Invalid, 3315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2551 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-16 15:02:10,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6637 states. [2025-03-16 15:02:10,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6637 to 6630. [2025-03-16 15:02:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6630 states, 6629 states have (on average 1.2722884296273949) internal successors, (8434), 6629 states have internal predecessors, (8434), 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-03-16 15:02:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6630 states to 6630 states and 8434 transitions. [2025-03-16 15:02:10,744 INFO L78 Accepts]: Start accepts. Automaton has 6630 states and 8434 transitions. Word has length 120 [2025-03-16 15:02:10,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:10,745 INFO L471 AbstractCegarLoop]: Abstraction has 6630 states and 8434 transitions. [2025-03-16 15:02:10,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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-03-16 15:02:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 6630 states and 8434 transitions. [2025-03-16 15:02:10,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 15:02:10,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:10,748 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:10,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:02:10,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:10,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:10,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1172030162, now seen corresponding path program 1 times [2025-03-16 15:02:10,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:10,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900716931] [2025-03-16 15:02:10,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:10,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:10,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 15:02:10,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 15:02:10,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:10,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:10,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:10,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900716931] [2025-03-16 15:02:10,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900716931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:10,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:10,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:10,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916171668] [2025-03-16 15:02:10,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:10,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:10,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:10,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:10,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:10,872 INFO L87 Difference]: Start difference. First operand 6630 states and 8434 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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-03-16 15:02:13,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:13,501 INFO L93 Difference]: Finished difference Result 16436 states and 21418 transitions. [2025-03-16 15:02:13,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:13,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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) Word has length 123 [2025-03-16 15:02:13,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:13,524 INFO L225 Difference]: With dead ends: 16436 [2025-03-16 15:02:13,524 INFO L226 Difference]: Without dead ends: 9807 [2025-03-16 15:02:13,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:13,532 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 1002 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 1004 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 3396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1004 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:13,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 830 Invalid, 3396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1004 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:02:13,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9807 states. [2025-03-16 15:02:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9807 to 9796. [2025-03-16 15:02:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9796 states, 9795 states have (on average 1.2739152628892292) internal successors, (12478), 9795 states have internal predecessors, (12478), 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-03-16 15:02:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9796 states to 9796 states and 12478 transitions. [2025-03-16 15:02:13,647 INFO L78 Accepts]: Start accepts. Automaton has 9796 states and 12478 transitions. Word has length 123 [2025-03-16 15:02:13,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:13,647 INFO L471 AbstractCegarLoop]: Abstraction has 9796 states and 12478 transitions. [2025-03-16 15:02:13,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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-03-16 15:02:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 9796 states and 12478 transitions. [2025-03-16 15:02:13,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-16 15:02:13,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:13,649 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:13,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:02:13,649 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:13,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:13,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1173972488, now seen corresponding path program 1 times [2025-03-16 15:02:13,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:13,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819936898] [2025-03-16 15:02:13,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:13,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:13,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-16 15:02:13,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-16 15:02:13,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:13,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:14,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:14,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819936898] [2025-03-16 15:02:14,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819936898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:14,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:14,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:14,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617125180] [2025-03-16 15:02:14,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:14,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:02:14,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:14,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:02:14,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:02:14,230 INFO L87 Difference]: Start difference. First operand 9796 states and 12478 transitions. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 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-03-16 15:02:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:18,829 INFO L93 Difference]: Finished difference Result 29888 states and 37878 transitions. [2025-03-16 15:02:18,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:02:18,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 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) Word has length 200 [2025-03-16 15:02:18,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:18,865 INFO L225 Difference]: With dead ends: 29888 [2025-03-16 15:02:18,865 INFO L226 Difference]: Without dead ends: 20093 [2025-03-16 15:02:18,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:02:18,872 INFO L435 NwaCegarLoop]: 1033 mSDtfsCounter, 2124 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 5793 mSolverCounterSat, 547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2124 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 6340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 5793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:18,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2124 Valid, 1308 Invalid, 6340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [547 Valid, 5793 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-16 15:02:18,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20093 states. [2025-03-16 15:02:19,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20093 to 20065. [2025-03-16 15:02:19,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20065 states, 20064 states have (on average 1.1845095693779903) internal successors, (23766), 20064 states have internal predecessors, (23766), 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-03-16 15:02:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20065 states to 20065 states and 23766 transitions. [2025-03-16 15:02:19,085 INFO L78 Accepts]: Start accepts. Automaton has 20065 states and 23766 transitions. Word has length 200 [2025-03-16 15:02:19,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:19,085 INFO L471 AbstractCegarLoop]: Abstraction has 20065 states and 23766 transitions. [2025-03-16 15:02:19,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 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-03-16 15:02:19,086 INFO L276 IsEmpty]: Start isEmpty. Operand 20065 states and 23766 transitions. [2025-03-16 15:02:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-16 15:02:19,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:19,089 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:19,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:02:19,089 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:19,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1196321444, now seen corresponding path program 1 times [2025-03-16 15:02:19,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:19,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134363525] [2025-03-16 15:02:19,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:19,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:19,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-16 15:02:19,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-16 15:02:19,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:19,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:19,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:19,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134363525] [2025-03-16 15:02:19,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134363525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:19,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:19,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:19,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186209423] [2025-03-16 15:02:19,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:19,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:19,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:19,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:19,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:19,289 INFO L87 Difference]: Start difference. First operand 20065 states and 23766 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-03-16 15:02:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:21,870 INFO L93 Difference]: Finished difference Result 45652 states and 54277 transitions. [2025-03-16 15:02:21,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:21,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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) Word has length 233 [2025-03-16 15:02:21,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:21,908 INFO L225 Difference]: With dead ends: 45652 [2025-03-16 15:02:21,908 INFO L226 Difference]: Without dead ends: 26375 [2025-03-16 15:02:21,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:21,920 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 858 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 655 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 3043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 655 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:21,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 949 Invalid, 3043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [655 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:02:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26375 states. [2025-03-16 15:02:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26375 to 25577. [2025-03-16 15:02:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25577 states, 25576 states have (on average 1.1775883640913356) internal successors, (30118), 25576 states have internal predecessors, (30118), 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-03-16 15:02:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25577 states to 25577 states and 30118 transitions. [2025-03-16 15:02:22,194 INFO L78 Accepts]: Start accepts. Automaton has 25577 states and 30118 transitions. Word has length 233 [2025-03-16 15:02:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:22,195 INFO L471 AbstractCegarLoop]: Abstraction has 25577 states and 30118 transitions. [2025-03-16 15:02:22,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-03-16 15:02:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 25577 states and 30118 transitions. [2025-03-16 15:02:22,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-16 15:02:22,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:22,202 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:22,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:02:22,202 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:22,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:22,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2113201733, now seen corresponding path program 1 times [2025-03-16 15:02:22,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:22,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384163906] [2025-03-16 15:02:22,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:22,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:22,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-16 15:02:22,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-16 15:02:22,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:22,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:22,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:22,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384163906] [2025-03-16 15:02:22,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384163906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:22,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:22,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:22,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457557725] [2025-03-16 15:02:22,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:22,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:22,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:22,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:22,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:22,568 INFO L87 Difference]: Start difference. First operand 25577 states and 30118 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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-03-16 15:02:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:25,163 INFO L93 Difference]: Finished difference Result 51186 states and 60295 transitions. [2025-03-16 15:02:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:25,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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) Word has length 296 [2025-03-16 15:02:25,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:25,211 INFO L225 Difference]: With dead ends: 51186 [2025-03-16 15:02:25,212 INFO L226 Difference]: Without dead ends: 26397 [2025-03-16 15:02:25,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:25,234 INFO L435 NwaCegarLoop]: 1774 mSDtfsCounter, 722 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2542 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 2542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:25,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1916 Invalid, 2855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 2542 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:02:25,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26397 states. [2025-03-16 15:02:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26397 to 26365. [2025-03-16 15:02:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26365 states, 26364 states have (on average 1.1610908815050827) internal successors, (30611), 26364 states have internal predecessors, (30611), 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-03-16 15:02:25,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26365 states to 26365 states and 30611 transitions. [2025-03-16 15:02:25,518 INFO L78 Accepts]: Start accepts. Automaton has 26365 states and 30611 transitions. Word has length 296 [2025-03-16 15:02:25,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:25,518 INFO L471 AbstractCegarLoop]: Abstraction has 26365 states and 30611 transitions. [2025-03-16 15:02:25,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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-03-16 15:02:25,519 INFO L276 IsEmpty]: Start isEmpty. Operand 26365 states and 30611 transitions. [2025-03-16 15:02:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-16 15:02:25,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:25,525 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:25,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:02:25,525 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:25,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:25,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1833367633, now seen corresponding path program 1 times [2025-03-16 15:02:25,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:25,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021047419] [2025-03-16 15:02:25,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:25,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:25,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-16 15:02:25,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-16 15:02:25,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:25,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:25,729 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-16 15:02:25,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:25,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021047419] [2025-03-16 15:02:25,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021047419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:25,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:25,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:25,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605750746] [2025-03-16 15:02:25,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:25,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:02:25,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:25,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:02:25,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:02:25,731 INFO L87 Difference]: Start difference. First operand 26365 states and 30611 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 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-03-16 15:02:31,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:31,001 INFO L93 Difference]: Finished difference Result 77341 states and 91873 transitions. [2025-03-16 15:02:31,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:02:31,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 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) Word has length 322 [2025-03-16 15:02:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:31,055 INFO L225 Difference]: With dead ends: 77341 [2025-03-16 15:02:31,055 INFO L226 Difference]: Without dead ends: 51764 [2025-03-16 15:02:31,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:02:31,073 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 1709 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 7165 mSolverCounterSat, 991 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 8156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 991 IncrementalHoareTripleChecker+Valid, 7165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:31,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 1120 Invalid, 8156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [991 Valid, 7165 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-16 15:02:31,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51764 states. [2025-03-16 15:02:31,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51764 to 51640. [2025-03-16 15:02:31,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51640 states, 51639 states have (on average 1.167257305524894) internal successors, (60276), 51639 states have internal predecessors, (60276), 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-03-16 15:02:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51640 states to 51640 states and 60276 transitions. [2025-03-16 15:02:31,504 INFO L78 Accepts]: Start accepts. Automaton has 51640 states and 60276 transitions. Word has length 322 [2025-03-16 15:02:31,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:31,504 INFO L471 AbstractCegarLoop]: Abstraction has 51640 states and 60276 transitions. [2025-03-16 15:02:31,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 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-03-16 15:02:31,505 INFO L276 IsEmpty]: Start isEmpty. Operand 51640 states and 60276 transitions. [2025-03-16 15:02:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-16 15:02:31,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:31,508 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:31,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:02:31,509 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:31,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:31,512 INFO L85 PathProgramCache]: Analyzing trace with hash 726645868, now seen corresponding path program 1 times [2025-03-16 15:02:31,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:31,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318324823] [2025-03-16 15:02:31,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:31,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:31,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-16 15:02:31,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-16 15:02:31,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:31,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:31,842 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-16 15:02:31,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:31,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318324823] [2025-03-16 15:02:31,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318324823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:31,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:31,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:31,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723014969] [2025-03-16 15:02:31,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:31,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:31,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:31,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:31,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:31,843 INFO L87 Difference]: Start difference. First operand 51640 states and 60276 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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-03-16 15:02:35,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:35,035 INFO L93 Difference]: Finished difference Result 115092 states and 136199 transitions. [2025-03-16 15:02:35,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:35,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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) Word has length 325 [2025-03-16 15:02:35,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:35,103 INFO L225 Difference]: With dead ends: 115092 [2025-03-16 15:02:35,103 INFO L226 Difference]: Without dead ends: 64240 [2025-03-16 15:02:35,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:35,124 INFO L435 NwaCegarLoop]: 1833 mSDtfsCounter, 821 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 727 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 3291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 727 IncrementalHoareTripleChecker+Valid, 2564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:35,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1983 Invalid, 3291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [727 Valid, 2564 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-16 15:02:35,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64240 states. [2025-03-16 15:02:35,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64240 to 63444. [2025-03-16 15:02:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63444 states, 63443 states have (on average 1.1513799788786785) internal successors, (73047), 63443 states have internal predecessors, (73047), 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-03-16 15:02:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63444 states to 63444 states and 73047 transitions. [2025-03-16 15:02:35,789 INFO L78 Accepts]: Start accepts. Automaton has 63444 states and 73047 transitions. Word has length 325 [2025-03-16 15:02:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:35,789 INFO L471 AbstractCegarLoop]: Abstraction has 63444 states and 73047 transitions. [2025-03-16 15:02:35,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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-03-16 15:02:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 63444 states and 73047 transitions. [2025-03-16 15:02:35,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-16 15:02:35,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:35,794 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:35,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:02:35,794 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:35,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:35,795 INFO L85 PathProgramCache]: Analyzing trace with hash 886094552, now seen corresponding path program 1 times [2025-03-16 15:02:35,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:35,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969122011] [2025-03-16 15:02:35,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:35,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:35,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-16 15:02:35,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-16 15:02:35,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:35,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 15:02:36,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:36,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969122011] [2025-03-16 15:02:36,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969122011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:36,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:36,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:36,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027688622] [2025-03-16 15:02:36,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:36,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:36,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:36,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:36,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:36,280 INFO L87 Difference]: Start difference. First operand 63444 states and 73047 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-03-16 15:02:39,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:39,080 INFO L93 Difference]: Finished difference Result 126098 states and 145300 transitions. [2025-03-16 15:02:39,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:39,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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) Word has length 350 [2025-03-16 15:02:39,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:39,145 INFO L225 Difference]: With dead ends: 126098 [2025-03-16 15:02:39,145 INFO L226 Difference]: Without dead ends: 63442 [2025-03-16 15:02:39,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:39,174 INFO L435 NwaCegarLoop]: 1371 mSDtfsCounter, 1179 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:39,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 1453 Invalid, 2922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:02:39,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63442 states. [2025-03-16 15:02:39,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63442 to 63441. [2025-03-16 15:02:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63441 states, 63440 states have (on average 1.1188839848675913) internal successors, (70982), 63440 states have internal predecessors, (70982), 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-03-16 15:02:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63441 states to 63441 states and 70982 transitions. [2025-03-16 15:02:39,710 INFO L78 Accepts]: Start accepts. Automaton has 63441 states and 70982 transitions. Word has length 350 [2025-03-16 15:02:39,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:39,710 INFO L471 AbstractCegarLoop]: Abstraction has 63441 states and 70982 transitions. [2025-03-16 15:02:39,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-03-16 15:02:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 63441 states and 70982 transitions. [2025-03-16 15:02:39,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-16 15:02:39,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:39,717 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:39,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:02:39,717 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:39,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:39,718 INFO L85 PathProgramCache]: Analyzing trace with hash 431424574, now seen corresponding path program 1 times [2025-03-16 15:02:39,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:39,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617076473] [2025-03-16 15:02:39,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:39,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:39,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-16 15:02:39,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-16 15:02:39,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:39,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 15:02:40,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:40,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617076473] [2025-03-16 15:02:40,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617076473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:40,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:40,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:40,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151775979] [2025-03-16 15:02:40,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:40,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:40,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:40,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:40,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:40,304 INFO L87 Difference]: Start difference. First operand 63441 states and 70982 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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-03-16 15:02:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:43,537 INFO L93 Difference]: Finished difference Result 126107 states and 141200 transitions. [2025-03-16 15:02:43,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:43,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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) Word has length 428 [2025-03-16 15:02:43,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:43,616 INFO L225 Difference]: With dead ends: 126107 [2025-03-16 15:02:43,616 INFO L226 Difference]: Without dead ends: 63454 [2025-03-16 15:02:43,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:43,660 INFO L435 NwaCegarLoop]: 1728 mSDtfsCounter, 799 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 685 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 3198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 685 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:43,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1879 Invalid, 3198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [685 Valid, 2513 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-16 15:02:43,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63454 states. [2025-03-16 15:02:44,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63454 to 62644. [2025-03-16 15:02:44,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62644 states, 62643 states have (on average 1.0835528311223919) internal successors, (67877), 62643 states have internal predecessors, (67877), 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-03-16 15:02:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62644 states to 62644 states and 67877 transitions. [2025-03-16 15:02:44,305 INFO L78 Accepts]: Start accepts. Automaton has 62644 states and 67877 transitions. Word has length 428 [2025-03-16 15:02:44,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:44,305 INFO L471 AbstractCegarLoop]: Abstraction has 62644 states and 67877 transitions. [2025-03-16 15:02:44,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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-03-16 15:02:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 62644 states and 67877 transitions. [2025-03-16 15:02:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-16 15:02:44,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:44,312 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:44,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:02:44,313 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:44,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:44,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1226379237, now seen corresponding path program 1 times [2025-03-16 15:02:44,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:44,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231476839] [2025-03-16 15:02:44,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:44,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:44,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-16 15:02:44,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-16 15:02:44,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:44,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-16 15:02:44,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:44,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231476839] [2025-03-16 15:02:44,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231476839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:44,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:44,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:44,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317805229] [2025-03-16 15:02:44,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:44,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:44,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:44,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:44,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:44,440 INFO L87 Difference]: Start difference. First operand 62644 states and 67877 transitions. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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-03-16 15:02:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:47,298 INFO L93 Difference]: Finished difference Result 163832 states and 178087 transitions. [2025-03-16 15:02:47,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:47,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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) Word has length 456 [2025-03-16 15:02:47,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:47,395 INFO L225 Difference]: With dead ends: 163832 [2025-03-16 15:02:47,395 INFO L226 Difference]: Without dead ends: 97247 [2025-03-16 15:02:47,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:47,439 INFO L435 NwaCegarLoop]: 1759 mSDtfsCounter, 874 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2446 mSolverCounterSat, 800 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 3246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 800 IncrementalHoareTripleChecker+Valid, 2446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:47,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 1893 Invalid, 3246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [800 Valid, 2446 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:02:47,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97247 states. [2025-03-16 15:02:48,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97247 to 92516. [2025-03-16 15:02:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92516 states, 92515 states have (on average 1.073361076582176) internal successors, (99302), 92515 states have internal predecessors, (99302), 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-03-16 15:02:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92516 states to 92516 states and 99302 transitions. [2025-03-16 15:02:48,264 INFO L78 Accepts]: Start accepts. Automaton has 92516 states and 99302 transitions. Word has length 456 [2025-03-16 15:02:48,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:48,264 INFO L471 AbstractCegarLoop]: Abstraction has 92516 states and 99302 transitions. [2025-03-16 15:02:48,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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-03-16 15:02:48,264 INFO L276 IsEmpty]: Start isEmpty. Operand 92516 states and 99302 transitions. [2025-03-16 15:02:48,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-03-16 15:02:48,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:48,273 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:48,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:02:48,273 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:48,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:48,274 INFO L85 PathProgramCache]: Analyzing trace with hash -47353970, now seen corresponding path program 1 times [2025-03-16 15:02:48,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:48,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389010511] [2025-03-16 15:02:48,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:48,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:48,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-16 15:02:48,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-16 15:02:48,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:48,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 15:02:48,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:48,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389010511] [2025-03-16 15:02:48,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389010511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:48,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:48,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:48,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173497598] [2025-03-16 15:02:48,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:48,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:02:48,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:48,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:02:48,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:02:48,943 INFO L87 Difference]: Start difference. First operand 92516 states and 99302 transitions. Second operand has 4 states, 4 states have (on average 74.5) internal successors, (298), 3 states have internal predecessors, (298), 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-03-16 15:02:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:53,821 INFO L93 Difference]: Finished difference Result 275603 states and 297101 transitions. [2025-03-16 15:02:53,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:02:53,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 3 states have internal predecessors, (298), 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) Word has length 480 [2025-03-16 15:02:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:54,046 INFO L225 Difference]: With dead ends: 275603 [2025-03-16 15:02:54,046 INFO L226 Difference]: Without dead ends: 183875 [2025-03-16 15:02:54,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:02:54,129 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 1486 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 5563 mSolverCounterSat, 821 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 6384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 821 IncrementalHoareTripleChecker+Valid, 5563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:54,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 987 Invalid, 6384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [821 Valid, 5563 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 15:02:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183875 states. [2025-03-16 15:02:55,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183875 to 180713. [2025-03-16 15:02:55,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180713 states, 180712 states have (on average 1.0659945106025057) internal successors, (192638), 180712 states have internal predecessors, (192638), 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-03-16 15:02:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180713 states to 180713 states and 192638 transitions. [2025-03-16 15:02:55,904 INFO L78 Accepts]: Start accepts. Automaton has 180713 states and 192638 transitions. Word has length 480 [2025-03-16 15:02:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:55,905 INFO L471 AbstractCegarLoop]: Abstraction has 180713 states and 192638 transitions. [2025-03-16 15:02:55,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 3 states have internal predecessors, (298), 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-03-16 15:02:55,905 INFO L276 IsEmpty]: Start isEmpty. Operand 180713 states and 192638 transitions. [2025-03-16 15:02:55,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-16 15:02:55,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:55,915 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:55,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:02:55,915 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:55,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:55,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1584619784, now seen corresponding path program 1 times [2025-03-16 15:02:55,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:55,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630588011] [2025-03-16 15:02:55,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:55,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:55,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-16 15:02:55,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-16 15:02:55,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:55,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-16 15:02:56,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:56,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630588011] [2025-03-16 15:02:56,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630588011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:56,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:56,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:56,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115579572] [2025-03-16 15:02:56,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:56,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:56,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:56,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:56,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:56,613 INFO L87 Difference]: Start difference. First operand 180713 states and 192638 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-03-16 15:02:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:59,584 INFO L93 Difference]: Finished difference Result 362220 states and 386077 transitions. [2025-03-16 15:02:59,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:59,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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) Word has length 494 [2025-03-16 15:02:59,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:59,802 INFO L225 Difference]: With dead ends: 362220 [2025-03-16 15:02:59,802 INFO L226 Difference]: Without dead ends: 182295 [2025-03-16 15:03:00,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:00,120 INFO L435 NwaCegarLoop]: 1400 mSDtfsCounter, 835 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2474 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:00,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1485 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2474 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:03:00,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182295 states. [2025-03-16 15:03:01,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182295 to 180707. [2025-03-16 15:03:01,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180707 states, 180706 states have (on average 1.053888636791252) internal successors, (190444), 180706 states have internal predecessors, (190444), 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-03-16 15:03:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180707 states to 180707 states and 190444 transitions. [2025-03-16 15:03:02,060 INFO L78 Accepts]: Start accepts. Automaton has 180707 states and 190444 transitions. Word has length 494 [2025-03-16 15:03:02,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:02,060 INFO L471 AbstractCegarLoop]: Abstraction has 180707 states and 190444 transitions. [2025-03-16 15:03:02,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-03-16 15:03:02,060 INFO L276 IsEmpty]: Start isEmpty. Operand 180707 states and 190444 transitions. [2025-03-16 15:03:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-16 15:03:02,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:02,073 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:03:02,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:03:02,074 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:02,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:02,074 INFO L85 PathProgramCache]: Analyzing trace with hash 546614783, now seen corresponding path program 1 times [2025-03-16 15:03:02,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:02,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269064868] [2025-03-16 15:03:02,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:02,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:02,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-16 15:03:02,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-16 15:03:02,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:02,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 303 proven. 113 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-16 15:03:03,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:03,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269064868] [2025-03-16 15:03:03,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269064868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:03:03,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394104833] [2025-03-16 15:03:03,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:03,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:03:03,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:03:03,382 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:03:03,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:03:03,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-16 15:03:03,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-16 15:03:03,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:03,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:03,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:03:03,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:03:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-16 15:03:03,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:03:03,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394104833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:03,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:03:03,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-16 15:03:03,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136659509] [2025-03-16 15:03:03,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:03,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:03,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:03,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:03,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:03:03,813 INFO L87 Difference]: Start difference. First operand 180707 states and 190444 transitions. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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-03-16 15:03:06,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:06,965 INFO L93 Difference]: Finished difference Result 355073 states and 375182 transitions. [2025-03-16 15:03:06,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:06,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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) Word has length 506 [2025-03-16 15:03:06,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:07,188 INFO L225 Difference]: With dead ends: 355073 [2025-03-16 15:03:07,188 INFO L226 Difference]: Without dead ends: 190900 [2025-03-16 15:03:07,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:03:07,266 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 1087 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2248 mSolverCounterSat, 737 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 737 IncrementalHoareTripleChecker+Valid, 2248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:07,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 356 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [737 Valid, 2248 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 15:03:07,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190900 states. [2025-03-16 15:03:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190900 to 190900. [2025-03-16 15:03:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190900 states, 190899 states have (on average 1.0516555875096254) internal successors, (200760), 190899 states have internal predecessors, (200760), 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-03-16 15:03:09,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190900 states to 190900 states and 200760 transitions. [2025-03-16 15:03:09,288 INFO L78 Accepts]: Start accepts. Automaton has 190900 states and 200760 transitions. Word has length 506 [2025-03-16 15:03:09,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:09,288 INFO L471 AbstractCegarLoop]: Abstraction has 190900 states and 200760 transitions. [2025-03-16 15:03:09,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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-03-16 15:03:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 190900 states and 200760 transitions. [2025-03-16 15:03:09,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-03-16 15:03:09,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:09,314 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:03:09,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:03:09,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 15:03:09,515 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:09,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:09,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1480469888, now seen corresponding path program 1 times [2025-03-16 15:03:09,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:09,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997916222] [2025-03-16 15:03:09,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:09,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:09,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-16 15:03:09,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-16 15:03:09,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:09,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-16 15:03:09,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:09,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997916222] [2025-03-16 15:03:09,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997916222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:09,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:09,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:03:09,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419860191] [2025-03-16 15:03:09,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:09,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:03:09,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:09,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:03:09,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:03:09,986 INFO L87 Difference]: Start difference. First operand 190900 states and 200760 transitions. Second operand has 4 states, 4 states have (on average 140.25) internal successors, (561), 3 states have internal predecessors, (561), 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-03-16 15:03:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:13,538 INFO L93 Difference]: Finished difference Result 373925 states and 393597 transitions. [2025-03-16 15:03:13,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:03:13,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 140.25) internal successors, (561), 3 states have internal predecessors, (561), 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) Word has length 593 [2025-03-16 15:03:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:13,815 INFO L225 Difference]: With dead ends: 373925 [2025-03-16 15:03:13,815 INFO L226 Difference]: Without dead ends: 197983 [2025-03-16 15:03:13,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:03:13,934 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 1424 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 4129 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1424 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 4548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 4129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:13,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1424 Valid, 939 Invalid, 4548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 4129 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 15:03:14,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197983 states.