./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label47.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label47.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 584120db80e48cf9596b5da45bc5f64e7e8f9b48dd0380aa05459606ea632f16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:05:38,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:05:38,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:05:38,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:05:38,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:05:38,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:05:38,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:05:38,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:05:38,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:05:38,630 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:05:38,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:05:38,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:05:38,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:05:38,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:05:38,632 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:05:38,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:05:38,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:05:38,633 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:05:38,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:05:38,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:05:38,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:05:38,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:05:38,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:05:38,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:05:38,634 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:05:38,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:05:38,634 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:05:38,634 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:05:38,634 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:05:38,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:05:38,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:05:38,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:05:38,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:05:38,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:05:38,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:05:38,636 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:05:38,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:05:38,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:05:38,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:05:38,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:05:38,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:05:38,636 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:05:38,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:05:38,636 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-jdk21/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 -> 584120db80e48cf9596b5da45bc5f64e7e8f9b48dd0380aa05459606ea632f16 [2025-02-05 12:05:38,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:05:38,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:05:38,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:05:38,941 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:05:38,942 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:05:38,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label47.c [2025-02-05 12:05:40,246 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3aa81d17d/9fc4113c48c8464eb692dd353df771da/FLAGde2c09861 [2025-02-05 12:05:40,699 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:05:40,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label47.c [2025-02-05 12:05:40,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3aa81d17d/9fc4113c48c8464eb692dd353df771da/FLAGde2c09861 [2025-02-05 12:05:40,754 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3aa81d17d/9fc4113c48c8464eb692dd353df771da [2025-02-05 12:05:40,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:05:40,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:05:40,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:05:40,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:05:40,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:05:40,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:05:40" (1/1) ... [2025-02-05 12:05:40,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1754c674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:40, skipping insertion in model container [2025-02-05 12:05:40,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:05:40" (1/1) ... [2025-02-05 12:05:40,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:05:41,044 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label47.c[6608,6621] [2025-02-05 12:05:41,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:05:41,485 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:05:41,511 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label47.c[6608,6621] [2025-02-05 12:05:41,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:05:41,785 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:05:41,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:41 WrapperNode [2025-02-05 12:05:41,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:05:41,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:05:41,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:05:41,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:05:41,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:41" (1/1) ... [2025-02-05 12:05:41,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:41" (1/1) ... [2025-02-05 12:05:42,110 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-02-05 12:05:42,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:05:42,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:05:42,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:05:42,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:05:42,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:41" (1/1) ... [2025-02-05 12:05:42,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:41" (1/1) ... [2025-02-05 12:05:42,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:41" (1/1) ... [2025-02-05 12:05:42,389 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-02-05 12:05:42,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:41" (1/1) ... [2025-02-05 12:05:42,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:41" (1/1) ... [2025-02-05 12:05:42,543 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:41" (1/1) ... [2025-02-05 12:05:42,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:41" (1/1) ... [2025-02-05 12:05:42,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:41" (1/1) ... [2025-02-05 12:05:42,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:41" (1/1) ... [2025-02-05 12:05:42,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:05:42,700 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:05:42,700 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:05:42,701 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:05:42,702 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:41" (1/1) ... [2025-02-05 12:05:42,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:05:42,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:05:42,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 12:05:42,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 12:05:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:05:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:05:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:05:42,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:05:42,846 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:05:42,848 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:05:46,587 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-02-05 12:05:46,754 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-02-05 12:05:46,754 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:05:46,782 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:05:46,786 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:05:46,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:05:46 BoogieIcfgContainer [2025-02-05 12:05:46,787 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:05:46,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:05:46,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:05:46,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:05:46,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:05:40" (1/3) ... [2025-02-05 12:05:46,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@feb95fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:05:46, skipping insertion in model container [2025-02-05 12:05:46,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:41" (2/3) ... [2025-02-05 12:05:46,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@feb95fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:05:46, skipping insertion in model container [2025-02-05 12:05:46,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:05:46" (3/3) ... [2025-02-05 12:05:46,800 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label47.c [2025-02-05 12:05:46,814 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:05:46,817 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label47.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:05:46,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:05:46,919 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;@2ef80873, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:05:46,920 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:05:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 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-02-05 12:05:46,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 12:05:46,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:46,938 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:05:46,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:46,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:46,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1621247163, now seen corresponding path program 1 times [2025-02-05 12:05:46,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:46,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562691434] [2025-02-05 12:05:46,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:46,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:47,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 12:05:47,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 12:05:47,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:47,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:05:47,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:47,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562691434] [2025-02-05 12:05:47,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562691434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:47,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:47,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:05:47,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139970937] [2025-02-05 12:05:47,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:47,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:47,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:47,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:47,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:47,365 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 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 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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-02-05 12:05:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:50,015 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-02-05 12:05:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:50,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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 44 [2025-02-05 12:05:50,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:50,032 INFO L225 Difference]: With dead ends: 1644 [2025-02-05 12:05:50,032 INFO L226 Difference]: Without dead ends: 977 [2025-02-05 12:05:50,036 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-02-05 12:05:50,039 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 444 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:50,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 12:05:50,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-02-05 12:05:50,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-02-05 12:05:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 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-02-05 12:05:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-02-05 12:05:50,159 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 44 [2025-02-05 12:05:50,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:50,160 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-02-05 12:05:50,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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-02-05 12:05:50,161 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-02-05 12:05:50,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 12:05:50,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:50,164 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, 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] [2025-02-05 12:05:50,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:05:50,165 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:50,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:50,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1269041401, now seen corresponding path program 1 times [2025-02-05 12:05:50,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:50,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824131797] [2025-02-05 12:05:50,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:50,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:50,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 12:05:50,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 12:05:50,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:50,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:05:50,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:50,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824131797] [2025-02-05 12:05:50,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824131797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:50,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:50,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:05:50,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048948622] [2025-02-05 12:05:50,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:50,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:50,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:50,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:50,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:50,510 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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-02-05 12:05:52,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:52,696 INFO L93 Difference]: Finished difference Result 2815 states and 4382 transitions. [2025-02-05 12:05:52,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:52,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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 111 [2025-02-05 12:05:52,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:52,705 INFO L225 Difference]: With dead ends: 2815 [2025-02-05 12:05:52,706 INFO L226 Difference]: Without dead ends: 1846 [2025-02-05 12:05:52,710 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-02-05 12:05:52,711 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:52,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 581 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:05:52,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2025-02-05 12:05:52,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1841. [2025-02-05 12:05:52,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.3505434782608696) internal successors, (2485), 1840 states have internal predecessors, (2485), 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-02-05 12:05:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2485 transitions. [2025-02-05 12:05:52,779 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2485 transitions. Word has length 111 [2025-02-05 12:05:52,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:52,780 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2485 transitions. [2025-02-05 12:05:52,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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-02-05 12:05:52,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2485 transitions. [2025-02-05 12:05:52,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 12:05:52,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:52,787 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, 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] [2025-02-05 12:05:52,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:05:52,788 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:52,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:52,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1360857939, now seen corresponding path program 1 times [2025-02-05 12:05:52,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:52,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872672707] [2025-02-05 12:05:52,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:52,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:52,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 12:05:52,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 12:05:52,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:52,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:05:53,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:53,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872672707] [2025-02-05 12:05:53,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872672707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:53,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:53,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:53,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803987418] [2025-02-05 12:05:53,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:53,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:05:53,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:53,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:05:53,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:05:53,186 INFO L87 Difference]: Start difference. First operand 1841 states and 2485 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 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-02-05 12:05:56,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:56,542 INFO L93 Difference]: Finished difference Result 5865 states and 8159 transitions. [2025-02-05 12:05:56,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:05:56,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 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 114 [2025-02-05 12:05:56,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:56,559 INFO L225 Difference]: With dead ends: 5865 [2025-02-05 12:05:56,559 INFO L226 Difference]: Without dead ends: 4026 [2025-02-05 12:05:56,562 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-02-05 12:05:56,563 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 1001 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 2760 mSolverCounterSat, 760 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 3520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 760 IncrementalHoareTripleChecker+Valid, 2760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:56,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 414 Invalid, 3520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [760 Valid, 2760 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 12:05:56,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2025-02-05 12:05:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 4020. [2025-02-05 12:05:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4020 states, 4019 states have (on average 1.3264493655138094) internal successors, (5331), 4019 states have internal predecessors, (5331), 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-02-05 12:05:56,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 5331 transitions. [2025-02-05 12:05:56,645 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 5331 transitions. Word has length 114 [2025-02-05 12:05:56,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:56,646 INFO L471 AbstractCegarLoop]: Abstraction has 4020 states and 5331 transitions. [2025-02-05 12:05:56,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 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-02-05 12:05:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 5331 transitions. [2025-02-05 12:05:56,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 12:05:56,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:56,652 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:05:56,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:05:56,652 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:56,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:56,653 INFO L85 PathProgramCache]: Analyzing trace with hash -394975740, now seen corresponding path program 1 times [2025-02-05 12:05:56,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:56,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033915840] [2025-02-05 12:05:56,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:56,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:56,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 12:05:56,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 12:05:56,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:56,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 12:05:56,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:56,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033915840] [2025-02-05 12:05:56,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033915840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:56,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:56,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:05:56,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373057138] [2025-02-05 12:05:56,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:56,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:56,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:56,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:56,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:56,936 INFO L87 Difference]: Start difference. First operand 4020 states and 5331 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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-02-05 12:05:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:58,812 INFO L93 Difference]: Finished difference Result 10602 states and 14367 transitions. [2025-02-05 12:05:58,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:58,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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 179 [2025-02-05 12:05:58,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:58,839 INFO L225 Difference]: With dead ends: 10602 [2025-02-05 12:05:58,840 INFO L226 Difference]: Without dead ends: 6580 [2025-02-05 12:05:58,848 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-02-05 12:05:58,851 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:58,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:05:58,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6580 states. [2025-02-05 12:05:58,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6580 to 5301. [2025-02-05 12:05:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5301 states, 5300 states have (on average 1.2269811320754718) internal successors, (6503), 5300 states have internal predecessors, (6503), 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-02-05 12:05:58,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5301 states to 5301 states and 6503 transitions. [2025-02-05 12:05:58,979 INFO L78 Accepts]: Start accepts. Automaton has 5301 states and 6503 transitions. Word has length 179 [2025-02-05 12:05:58,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:58,981 INFO L471 AbstractCegarLoop]: Abstraction has 5301 states and 6503 transitions. [2025-02-05 12:05:58,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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-02-05 12:05:58,981 INFO L276 IsEmpty]: Start isEmpty. Operand 5301 states and 6503 transitions. [2025-02-05 12:05:58,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-05 12:05:58,985 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:58,985 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, 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, 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-02-05 12:05:58,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:05:58,986 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:58,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:58,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1360488052, now seen corresponding path program 1 times [2025-02-05 12:05:58,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:58,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715219059] [2025-02-05 12:05:58,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:58,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:59,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 12:05:59,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 12:05:59,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:59,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:59,284 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:05:59,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:59,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715219059] [2025-02-05 12:05:59,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715219059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:59,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:59,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:59,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191728891] [2025-02-05 12:05:59,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:59,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:59,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:59,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:59,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:59,288 INFO L87 Difference]: Start difference. First operand 5301 states and 6503 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-02-05 12:06:00,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:00,951 INFO L93 Difference]: Finished difference Result 13157 states and 16529 transitions. [2025-02-05 12:06:00,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:00,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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 192 [2025-02-05 12:06:00,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:00,972 INFO L225 Difference]: With dead ends: 13157 [2025-02-05 12:06:00,972 INFO L226 Difference]: Without dead ends: 7858 [2025-02-05 12:06:00,980 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-02-05 12:06:00,981 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 500 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:00,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 808 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:06:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7858 states. [2025-02-05 12:06:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7858 to 7858. [2025-02-05 12:06:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7858 states, 7857 states have (on average 1.2102583683339696) internal successors, (9509), 7857 states have internal predecessors, (9509), 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-02-05 12:06:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7858 states to 7858 states and 9509 transitions. [2025-02-05 12:06:01,135 INFO L78 Accepts]: Start accepts. Automaton has 7858 states and 9509 transitions. Word has length 192 [2025-02-05 12:06:01,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:01,136 INFO L471 AbstractCegarLoop]: Abstraction has 7858 states and 9509 transitions. [2025-02-05 12:06:01,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-02-05 12:06:01,137 INFO L276 IsEmpty]: Start isEmpty. Operand 7858 states and 9509 transitions. [2025-02-05 12:06:01,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-02-05 12:06:01,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:01,144 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, 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, 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] [2025-02-05 12:06:01,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:06:01,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:01,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:01,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1860437931, now seen corresponding path program 1 times [2025-02-05 12:06:01,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:01,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664069826] [2025-02-05 12:06:01,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:01,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:01,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-05 12:06:01,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-05 12:06:01,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:01,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:01,706 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-02-05 12:06:01,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:01,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664069826] [2025-02-05 12:06:01,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664069826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:01,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:01,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:06:01,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830076841] [2025-02-05 12:06:01,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:01,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:01,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:01,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:01,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:01,717 INFO L87 Difference]: Start difference. First operand 7858 states and 9509 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-02-05 12:06:04,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:04,092 INFO L93 Difference]: Finished difference Result 23005 states and 27850 transitions. [2025-02-05 12:06:04,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:04,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-02-05 12:06:04,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:04,133 INFO L225 Difference]: With dead ends: 23005 [2025-02-05 12:06:04,133 INFO L226 Difference]: Without dead ends: 15149 [2025-02-05 12:06:04,140 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-02-05 12:06:04,141 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 463 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:04,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 924 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 12:06:04,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15149 states. [2025-02-05 12:06:04,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15149 to 12995. [2025-02-05 12:06:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12995 states, 12994 states have (on average 1.2274126519932276) internal successors, (15949), 12994 states have internal predecessors, (15949), 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-02-05 12:06:04,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12995 states to 12995 states and 15949 transitions. [2025-02-05 12:06:04,363 INFO L78 Accepts]: Start accepts. Automaton has 12995 states and 15949 transitions. Word has length 296 [2025-02-05 12:06:04,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:04,363 INFO L471 AbstractCegarLoop]: Abstraction has 12995 states and 15949 transitions. [2025-02-05 12:06:04,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-02-05 12:06:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 12995 states and 15949 transitions. [2025-02-05 12:06:04,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-02-05 12:06:04,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:04,369 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, 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, 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] [2025-02-05 12:06:04,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:06:04,369 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:04,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:04,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1120004606, now seen corresponding path program 1 times [2025-02-05 12:06:04,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:04,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961035782] [2025-02-05 12:06:04,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:04,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:04,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-05 12:06:04,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-05 12:06:04,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:04,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-02-05 12:06:04,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:04,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961035782] [2025-02-05 12:06:04,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961035782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:04,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:04,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:06:04,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166168179] [2025-02-05 12:06:04,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:04,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:04,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:04,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:04,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:04,663 INFO L87 Difference]: Start difference. First operand 12995 states and 15949 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-02-05 12:06:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:06,898 INFO L93 Difference]: Finished difference Result 31501 states and 38602 transitions. [2025-02-05 12:06:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:06,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 297 [2025-02-05 12:06:06,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:06,941 INFO L225 Difference]: With dead ends: 31501 [2025-02-05 12:06:06,941 INFO L226 Difference]: Without dead ends: 17658 [2025-02-05 12:06:06,956 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-02-05 12:06:06,957 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 400 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:06,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 952 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:06:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17658 states. [2025-02-05 12:06:07,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17658 to 12121. [2025-02-05 12:06:07,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12121 states, 12120 states have (on average 1.1797029702970296) internal successors, (14298), 12120 states have internal predecessors, (14298), 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-02-05 12:06:07,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12121 states to 12121 states and 14298 transitions. [2025-02-05 12:06:07,150 INFO L78 Accepts]: Start accepts. Automaton has 12121 states and 14298 transitions. Word has length 297 [2025-02-05 12:06:07,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:07,151 INFO L471 AbstractCegarLoop]: Abstraction has 12121 states and 14298 transitions. [2025-02-05 12:06:07,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-02-05 12:06:07,151 INFO L276 IsEmpty]: Start isEmpty. Operand 12121 states and 14298 transitions. [2025-02-05 12:06:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-02-05 12:06:07,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:07,157 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, 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, 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] [2025-02-05 12:06:07,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:06:07,157 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:07,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:07,158 INFO L85 PathProgramCache]: Analyzing trace with hash 320476112, now seen corresponding path program 1 times [2025-02-05 12:06:07,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:07,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103732983] [2025-02-05 12:06:07,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:07,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:07,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-02-05 12:06:07,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-02-05 12:06:07,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:07,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-02-05 12:06:07,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:07,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103732983] [2025-02-05 12:06:07,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103732983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:07,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:07,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:06:07,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324610055] [2025-02-05 12:06:07,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:07,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:07,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:07,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:07,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:07,433 INFO L87 Difference]: Start difference. First operand 12121 states and 14298 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-02-05 12:06:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:09,228 INFO L93 Difference]: Finished difference Result 31045 states and 36681 transitions. [2025-02-05 12:06:09,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:09,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 314 [2025-02-05 12:06:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:09,270 INFO L225 Difference]: With dead ends: 31045 [2025-02-05 12:06:09,271 INFO L226 Difference]: Without dead ends: 18926 [2025-02-05 12:06:09,285 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-02-05 12:06:09,286 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 449 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:09,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 405 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:06:09,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18926 states. [2025-02-05 12:06:09,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18926 to 16793. [2025-02-05 12:06:09,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16793 states, 16792 states have (on average 1.167877560743211) internal successors, (19611), 16792 states have internal predecessors, (19611), 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-02-05 12:06:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16793 states to 16793 states and 19611 transitions. [2025-02-05 12:06:09,544 INFO L78 Accepts]: Start accepts. Automaton has 16793 states and 19611 transitions. Word has length 314 [2025-02-05 12:06:09,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:09,544 INFO L471 AbstractCegarLoop]: Abstraction has 16793 states and 19611 transitions. [2025-02-05 12:06:09,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-02-05 12:06:09,545 INFO L276 IsEmpty]: Start isEmpty. Operand 16793 states and 19611 transitions. [2025-02-05 12:06:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-02-05 12:06:09,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:09,554 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, 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, 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] [2025-02-05 12:06:09,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:06:09,555 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:09,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:09,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1767929469, now seen corresponding path program 1 times [2025-02-05 12:06:09,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:09,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031612124] [2025-02-05 12:06:09,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:09,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:09,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-02-05 12:06:09,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-02-05 12:06:09,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:09,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-02-05 12:06:09,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:09,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031612124] [2025-02-05 12:06:09,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031612124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:09,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:09,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:06:09,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920196413] [2025-02-05 12:06:09,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:09,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:09,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:09,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:09,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:09,979 INFO L87 Difference]: Start difference. First operand 16793 states and 19611 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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-02-05 12:06:11,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:11,753 INFO L93 Difference]: Finished difference Result 41278 states and 48341 transitions. [2025-02-05 12:06:11,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:11,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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 358 [2025-02-05 12:06:11,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:11,806 INFO L225 Difference]: With dead ends: 41278 [2025-02-05 12:06:11,807 INFO L226 Difference]: Without dead ends: 23623 [2025-02-05 12:06:11,825 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-02-05 12:06:11,827 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 482 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:11,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 800 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:06:11,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23623 states. [2025-02-05 12:06:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23623 to 21064. [2025-02-05 12:06:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21064 states, 21063 states have (on average 1.166595451740018) internal successors, (24572), 21063 states have internal predecessors, (24572), 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-02-05 12:06:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21064 states to 21064 states and 24572 transitions. [2025-02-05 12:06:12,105 INFO L78 Accepts]: Start accepts. Automaton has 21064 states and 24572 transitions. Word has length 358 [2025-02-05 12:06:12,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:12,106 INFO L471 AbstractCegarLoop]: Abstraction has 21064 states and 24572 transitions. [2025-02-05 12:06:12,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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-02-05 12:06:12,106 INFO L276 IsEmpty]: Start isEmpty. Operand 21064 states and 24572 transitions. [2025-02-05 12:06:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-02-05 12:06:12,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:12,114 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, 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, 3, 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] [2025-02-05 12:06:12,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 12:06:12,114 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:12,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:12,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1903580013, now seen corresponding path program 1 times [2025-02-05 12:06:12,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:12,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159467739] [2025-02-05 12:06:12,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:12,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:12,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-02-05 12:06:12,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-02-05 12:06:12,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:12,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:12,957 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-02-05 12:06:12,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:12,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159467739] [2025-02-05 12:06:12,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159467739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:12,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:12,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:06:12,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224946349] [2025-02-05 12:06:12,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:12,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:06:12,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:12,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:06:12,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:06:12,962 INFO L87 Difference]: Start difference. First operand 21064 states and 24572 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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-02-05 12:06:15,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:15,643 INFO L93 Difference]: Finished difference Result 61335 states and 70911 transitions. [2025-02-05 12:06:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:06:15,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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 366 [2025-02-05 12:06:15,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:15,701 INFO L225 Difference]: With dead ends: 61335 [2025-02-05 12:06:15,702 INFO L226 Difference]: Without dead ends: 39848 [2025-02-05 12:06:15,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-02-05 12:06:15,731 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 919 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 3017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 2515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:15,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 202 Invalid, 3017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 2515 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 12:06:15,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39848 states. [2025-02-05 12:06:16,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39848 to 26634. [2025-02-05 12:06:16,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26634 states, 26633 states have (on average 1.168475199939924) internal successors, (31120), 26633 states have internal predecessors, (31120), 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-02-05 12:06:16,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26634 states to 26634 states and 31120 transitions. [2025-02-05 12:06:16,253 INFO L78 Accepts]: Start accepts. Automaton has 26634 states and 31120 transitions. Word has length 366 [2025-02-05 12:06:16,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:16,253 INFO L471 AbstractCegarLoop]: Abstraction has 26634 states and 31120 transitions. [2025-02-05 12:06:16,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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-02-05 12:06:16,254 INFO L276 IsEmpty]: Start isEmpty. Operand 26634 states and 31120 transitions. [2025-02-05 12:06:16,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-02-05 12:06:16,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:16,266 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, 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, 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] [2025-02-05 12:06:16,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 12:06:16,266 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:16,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:16,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2025233477, now seen corresponding path program 1 times [2025-02-05 12:06:16,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:16,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459141999] [2025-02-05 12:06:16,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:16,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:16,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-02-05 12:06:16,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-02-05 12:06:16,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:16,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 12:06:16,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:16,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459141999] [2025-02-05 12:06:16,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459141999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:16,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:16,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:06:16,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138250650] [2025-02-05 12:06:16,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:16,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:16,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:16,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:16,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:16,712 INFO L87 Difference]: Start difference. First operand 26634 states and 31120 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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-02-05 12:06:18,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:18,347 INFO L93 Difference]: Finished difference Result 64404 states and 75814 transitions. [2025-02-05 12:06:18,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:18,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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 386 [2025-02-05 12:06:18,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:18,404 INFO L225 Difference]: With dead ends: 64404 [2025-02-05 12:06:18,405 INFO L226 Difference]: Without dead ends: 36922 [2025-02-05 12:06:18,433 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-02-05 12:06:18,434 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 379 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:18,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 886 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:06:18,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36922 states. [2025-02-05 12:06:18,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36922 to 36058. [2025-02-05 12:06:18,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36058 states, 36057 states have (on average 1.145353190781263) internal successors, (41298), 36057 states have internal predecessors, (41298), 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-02-05 12:06:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36058 states to 36058 states and 41298 transitions. [2025-02-05 12:06:18,886 INFO L78 Accepts]: Start accepts. Automaton has 36058 states and 41298 transitions. Word has length 386 [2025-02-05 12:06:18,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:18,888 INFO L471 AbstractCegarLoop]: Abstraction has 36058 states and 41298 transitions. [2025-02-05 12:06:18,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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-02-05 12:06:18,888 INFO L276 IsEmpty]: Start isEmpty. Operand 36058 states and 41298 transitions. [2025-02-05 12:06:18,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-02-05 12:06:18,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:18,898 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, 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, 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] [2025-02-05 12:06:18,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 12:06:18,899 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:18,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:18,900 INFO L85 PathProgramCache]: Analyzing trace with hash -914155193, now seen corresponding path program 1 times [2025-02-05 12:06:18,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:18,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925287138] [2025-02-05 12:06:18,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:18,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:18,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-02-05 12:06:19,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-02-05 12:06:19,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:19,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:19,336 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:06:19,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:19,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925287138] [2025-02-05 12:06:19,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925287138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:19,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:19,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:06:19,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515668998] [2025-02-05 12:06:19,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:19,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:19,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:19,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:19,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:19,339 INFO L87 Difference]: Start difference. First operand 36058 states and 41298 transitions. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-02-05 12:06:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:21,056 INFO L93 Difference]: Finished difference Result 82782 states and 94745 transitions. [2025-02-05 12:06:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:21,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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 433 [2025-02-05 12:06:21,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:21,111 INFO L225 Difference]: With dead ends: 82782 [2025-02-05 12:06:21,111 INFO L226 Difference]: Without dead ends: 45438 [2025-02-05 12:06:21,142 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-02-05 12:06:21,142 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 320 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:21,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 747 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:06:21,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45438 states. [2025-02-05 12:06:21,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45438 to 36049. [2025-02-05 12:06:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36049 states, 36048 states have (on average 1.1423102529960054) internal successors, (41178), 36048 states have internal predecessors, (41178), 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-02-05 12:06:21,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36049 states to 36049 states and 41178 transitions. [2025-02-05 12:06:21,652 INFO L78 Accepts]: Start accepts. Automaton has 36049 states and 41178 transitions. Word has length 433 [2025-02-05 12:06:21,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:21,652 INFO L471 AbstractCegarLoop]: Abstraction has 36049 states and 41178 transitions. [2025-02-05 12:06:21,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-02-05 12:06:21,653 INFO L276 IsEmpty]: Start isEmpty. Operand 36049 states and 41178 transitions. [2025-02-05 12:06:21,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-02-05 12:06:21,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:21,662 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, 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, 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] [2025-02-05 12:06:21,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 12:06:21,663 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:21,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:21,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1154345498, now seen corresponding path program 1 times [2025-02-05 12:06:21,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:21,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996651710] [2025-02-05 12:06:21,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:21,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:21,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-02-05 12:06:21,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-02-05 12:06:21,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:21,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:06:22,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:22,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996651710] [2025-02-05 12:06:22,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996651710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:22,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:22,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:06:22,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317578191] [2025-02-05 12:06:22,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:22,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:06:22,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:22,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:06:22,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:06:22,290 INFO L87 Difference]: Start difference. First operand 36049 states and 41178 transitions. Second operand has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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-02-05 12:06:24,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:24,898 INFO L93 Difference]: Finished difference Result 106198 states and 120766 transitions. [2025-02-05 12:06:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:06:24,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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 449 [2025-02-05 12:06:24,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:24,987 INFO L225 Difference]: With dead ends: 106198 [2025-02-05 12:06:24,987 INFO L226 Difference]: Without dead ends: 69726 [2025-02-05 12:06:25,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-02-05 12:06:25,025 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 783 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2611 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 3090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 2611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:25,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 187 Invalid, 3090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 2611 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 12:06:25,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69726 states. [2025-02-05 12:06:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69726 to 60287. [2025-02-05 12:06:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60287 states, 60286 states have (on average 1.1287695318979531) internal successors, (68049), 60286 states have internal predecessors, (68049), 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-02-05 12:06:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60287 states to 60287 states and 68049 transitions. [2025-02-05 12:06:25,983 INFO L78 Accepts]: Start accepts. Automaton has 60287 states and 68049 transitions. Word has length 449 [2025-02-05 12:06:25,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:25,984 INFO L471 AbstractCegarLoop]: Abstraction has 60287 states and 68049 transitions. [2025-02-05 12:06:25,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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-02-05 12:06:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 60287 states and 68049 transitions. [2025-02-05 12:06:25,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-02-05 12:06:25,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:25,997 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, 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, 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] [2025-02-05 12:06:25,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 12:06:25,997 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:25,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:25,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1372564578, now seen corresponding path program 1 times [2025-02-05 12:06:25,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:25,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609332069] [2025-02-05 12:06:25,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:25,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:26,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-02-05 12:06:26,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-02-05 12:06:26,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:26,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:26,408 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 551 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-02-05 12:06:26,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:26,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609332069] [2025-02-05 12:06:26,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609332069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:26,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:26,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:06:26,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915309456] [2025-02-05 12:06:26,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:26,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:26,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:26,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:26,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:26,410 INFO L87 Difference]: Start difference. First operand 60287 states and 68049 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-02-05 12:06:28,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:28,327 INFO L93 Difference]: Finished difference Result 141000 states and 159171 transitions. [2025-02-05 12:06:28,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:28,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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 468 [2025-02-05 12:06:28,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:28,428 INFO L225 Difference]: With dead ends: 141000 [2025-02-05 12:06:28,428 INFO L226 Difference]: Without dead ends: 79423 [2025-02-05 12:06:28,462 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-02-05 12:06:28,462 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 445 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:28,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 649 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:06:28,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79423 states. [2025-02-05 12:06:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79423 to 73450. [2025-02-05 12:06:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73450 states, 73449 states have (on average 1.1131124998298139) internal successors, (81757), 73449 states have internal predecessors, (81757), 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-02-05 12:06:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73450 states to 73450 states and 81757 transitions. [2025-02-05 12:06:29,502 INFO L78 Accepts]: Start accepts. Automaton has 73450 states and 81757 transitions. Word has length 468 [2025-02-05 12:06:29,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:29,502 INFO L471 AbstractCegarLoop]: Abstraction has 73450 states and 81757 transitions. [2025-02-05 12:06:29,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-02-05 12:06:29,502 INFO L276 IsEmpty]: Start isEmpty. Operand 73450 states and 81757 transitions. [2025-02-05 12:06:29,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-02-05 12:06:29,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:29,511 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:06:29,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 12:06:29,511 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:29,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:29,512 INFO L85 PathProgramCache]: Analyzing trace with hash 874077049, now seen corresponding path program 1 times [2025-02-05 12:06:29,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:29,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741430883] [2025-02-05 12:06:29,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:29,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:29,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-02-05 12:06:29,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-02-05 12:06:29,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:29,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-02-05 12:06:30,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:30,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741430883] [2025-02-05 12:06:30,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741430883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:30,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:30,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:06:30,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103141000] [2025-02-05 12:06:30,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:30,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:06:30,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:30,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:06:30,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:06:30,334 INFO L87 Difference]: Start difference. First operand 73450 states and 81757 transitions. Second operand has 4 states, 4 states have (on average 78.25) internal successors, (313), 4 states have internal predecessors, (313), 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-02-05 12:06:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:33,190 INFO L93 Difference]: Finished difference Result 184847 states and 205031 transitions. [2025-02-05 12:06:33,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:06:33,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.25) internal successors, (313), 4 states have internal predecessors, (313), 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 472 [2025-02-05 12:06:33,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:33,362 INFO L225 Difference]: With dead ends: 184847 [2025-02-05 12:06:33,362 INFO L226 Difference]: Without dead ends: 110974 [2025-02-05 12:06:33,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-02-05 12:06:33,397 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 812 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 2376 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 2822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 2376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:33,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 177 Invalid, 2822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 2376 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 12:06:33,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110974 states. [2025-02-05 12:06:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110974 to 102446. [2025-02-05 12:06:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102446 states, 102445 states have (on average 1.1084874810874128) internal successors, (113559), 102445 states have internal predecessors, (113559), 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-02-05 12:06:34,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102446 states to 102446 states and 113559 transitions. [2025-02-05 12:06:34,694 INFO L78 Accepts]: Start accepts. Automaton has 102446 states and 113559 transitions. Word has length 472 [2025-02-05 12:06:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:34,695 INFO L471 AbstractCegarLoop]: Abstraction has 102446 states and 113559 transitions. [2025-02-05 12:06:34,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.25) internal successors, (313), 4 states have internal predecessors, (313), 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-02-05 12:06:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 102446 states and 113559 transitions. [2025-02-05 12:06:34,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-02-05 12:06:34,705 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:34,705 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:06:34,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 12:06:34,705 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:34,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:34,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1930048002, now seen corresponding path program 1 times [2025-02-05 12:06:34,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:34,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115687480] [2025-02-05 12:06:34,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:34,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:34,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-02-05 12:06:34,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-02-05 12:06:34,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:34,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-02-05 12:06:35,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:35,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115687480] [2025-02-05 12:06:35,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115687480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:35,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:35,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:06:35,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138427988] [2025-02-05 12:06:35,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:35,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:06:35,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:35,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:06:35,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:06:35,417 INFO L87 Difference]: Start difference. First operand 102446 states and 113559 transitions. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 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-02-05 12:06:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:38,404 INFO L93 Difference]: Finished difference Result 231729 states and 256394 transitions. [2025-02-05 12:06:38,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:06:38,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 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 492 [2025-02-05 12:06:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:38,575 INFO L225 Difference]: With dead ends: 231729 [2025-02-05 12:06:38,575 INFO L226 Difference]: Without dead ends: 128008 [2025-02-05 12:06:38,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-02-05 12:06:38,652 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 787 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:38,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 225 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 12:06:38,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128008 states. [2025-02-05 12:06:39,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128008 to 101163. [2025-02-05 12:06:40,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101163 states, 101162 states have (on average 1.1060279551610288) internal successors, (111888), 101162 states have internal predecessors, (111888), 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-02-05 12:06:40,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101163 states to 101163 states and 111888 transitions. [2025-02-05 12:06:40,319 INFO L78 Accepts]: Start accepts. Automaton has 101163 states and 111888 transitions. Word has length 492 [2025-02-05 12:06:40,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:40,319 INFO L471 AbstractCegarLoop]: Abstraction has 101163 states and 111888 transitions. [2025-02-05 12:06:40,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 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-02-05 12:06:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 101163 states and 111888 transitions. [2025-02-05 12:06:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2025-02-05 12:06:40,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:40,332 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:06:40,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 12:06:40,332 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:40,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:40,333 INFO L85 PathProgramCache]: Analyzing trace with hash -548809011, now seen corresponding path program 1 times [2025-02-05 12:06:40,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:40,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369996020] [2025-02-05 12:06:40,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:40,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:40,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-02-05 12:06:40,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-02-05 12:06:40,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:40,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 630 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 12:06:41,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:41,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369996020] [2025-02-05 12:06:41,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369996020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:41,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:41,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:06:41,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754617058] [2025-02-05 12:06:41,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:41,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:06:41,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:41,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:06:41,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:06:41,006 INFO L87 Difference]: Start difference. First operand 101163 states and 111888 transitions. Second operand has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 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-02-05 12:06:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:43,955 INFO L93 Difference]: Finished difference Result 237301 states and 263341 transitions. [2025-02-05 12:06:43,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:06:43,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 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 512 [2025-02-05 12:06:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:44,121 INFO L225 Difference]: With dead ends: 237301 [2025-02-05 12:06:44,121 INFO L226 Difference]: Without dead ends: 136140 [2025-02-05 12:06:44,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-02-05 12:06:44,183 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 825 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:44,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 209 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 12:06:44,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136140 states. [2025-02-05 12:06:45,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136140 to 126769. [2025-02-05 12:06:45,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126769 states, 126768 states have (on average 1.1143111826328411) internal successors, (141259), 126768 states have internal predecessors, (141259), 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-02-05 12:06:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126769 states to 126769 states and 141259 transitions. [2025-02-05 12:06:45,743 INFO L78 Accepts]: Start accepts. Automaton has 126769 states and 141259 transitions. Word has length 512 [2025-02-05 12:06:45,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:45,744 INFO L471 AbstractCegarLoop]: Abstraction has 126769 states and 141259 transitions. [2025-02-05 12:06:45,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 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-02-05 12:06:45,744 INFO L276 IsEmpty]: Start isEmpty. Operand 126769 states and 141259 transitions. [2025-02-05 12:06:45,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-02-05 12:06:45,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:45,758 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, 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, 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] [2025-02-05 12:06:45,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 12:06:45,758 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:45,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:45,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1544122413, now seen corresponding path program 1 times [2025-02-05 12:06:45,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:45,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147152311] [2025-02-05 12:06:45,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:45,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:45,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-02-05 12:06:46,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-02-05 12:06:46,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:46,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 590 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-05 12:06:46,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147152311] [2025-02-05 12:06:46,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147152311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:46,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:46,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:06:46,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569284470] [2025-02-05 12:06:46,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:46,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:46,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:46,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:46,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:46,310 INFO L87 Difference]: Start difference. First operand 126769 states and 141259 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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-02-05 12:06:48,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:48,472 INFO L93 Difference]: Finished difference Result 282461 states and 315838 transitions. [2025-02-05 12:06:48,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:48,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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 531 [2025-02-05 12:06:48,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:48,676 INFO L225 Difference]: With dead ends: 282461 [2025-02-05 12:06:48,676 INFO L226 Difference]: Without dead ends: 155694 [2025-02-05 12:06:48,752 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-02-05 12:06:48,753 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 392 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:48,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 313 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:06:48,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155694 states. [2025-02-05 12:06:50,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155694 to 153981. [2025-02-05 12:06:50,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153981 states, 153980 states have (on average 1.1081828808936225) internal successors, (170638), 153980 states have internal predecessors, (170638), 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-02-05 12:06:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153981 states to 153981 states and 170638 transitions. [2025-02-05 12:06:50,801 INFO L78 Accepts]: Start accepts. Automaton has 153981 states and 170638 transitions. Word has length 531 [2025-02-05 12:06:50,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:50,801 INFO L471 AbstractCegarLoop]: Abstraction has 153981 states and 170638 transitions. [2025-02-05 12:06:50,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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-02-05 12:06:50,801 INFO L276 IsEmpty]: Start isEmpty. Operand 153981 states and 170638 transitions. [2025-02-05 12:06:50,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-02-05 12:06:50,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:50,812 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:06:50,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 12:06:50,812 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:50,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:50,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2057645545, now seen corresponding path program 1 times [2025-02-05 12:06:50,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:50,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524255928] [2025-02-05 12:06:50,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:50,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:51,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-02-05 12:06:51,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-02-05 12:06:51,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:51,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:51,872 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-02-05 12:06:51,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:51,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524255928] [2025-02-05 12:06:51,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524255928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:51,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:51,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:06:51,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117051216] [2025-02-05 12:06:51,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:51,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:06:51,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:51,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:06:51,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:06:51,874 INFO L87 Difference]: Start difference. First operand 153981 states and 170638 transitions. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 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)