./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label22.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/Problem18_label22.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 8328e3b00fffe34fe4036e6200cb72104f847b0ee3df41fd01aea5e06a24af7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:09:34,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:09:34,814 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:09:34,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:09:34,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:09:34,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:09:34,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:09:34,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:09:34,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:09:34,849 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:09:34,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:09:34,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:09:34,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:09:34,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:09:34,850 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:09:34,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:09:34,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:09:34,850 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:09:34,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:09:34,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:09:34,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:09:34,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:09:34,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:09:34,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:09:34,850 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:09:34,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:09:34,851 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:09:34,851 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:09:34,851 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:09:34,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:09:34,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:09:34,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:09:34,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:09:34,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:09:34,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:09:34,851 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:09:34,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:09:34,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:09:34,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:09:34,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:09:34,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:09:34,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:09:34,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:09:34,852 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 -> 8328e3b00fffe34fe4036e6200cb72104f847b0ee3df41fd01aea5e06a24af7e [2025-02-05 12:09:35,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:09:35,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:09:35,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:09:35,151 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:09:35,151 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:09:35,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label22.c [2025-02-05 12:09:36,552 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f2f43127/c3e413b780a641e89049cf78e372eb4c/FLAG2d02b5f52 [2025-02-05 12:09:37,046 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:09:37,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label22.c [2025-02-05 12:09:37,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f2f43127/c3e413b780a641e89049cf78e372eb4c/FLAG2d02b5f52 [2025-02-05 12:09:37,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f2f43127/c3e413b780a641e89049cf78e372eb4c [2025-02-05 12:09:37,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:09:37,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:09:37,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:09:37,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:09:37,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:09:37,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:09:37" (1/1) ... [2025-02-05 12:09:37,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4687e745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:09:37, skipping insertion in model container [2025-02-05 12:09:37,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:09:37" (1/1) ... [2025-02-05 12:09:37,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:09:37,425 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/Problem18_label22.c[4444,4457] [2025-02-05 12:09:37,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:09:37,937 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:09:37,956 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/Problem18_label22.c[4444,4457] [2025-02-05 12:09:38,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:09:38,254 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:09:38,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:09:38 WrapperNode [2025-02-05 12:09:38,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:09:38,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:09:38,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:09:38,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:09:38,264 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:09:38" (1/1) ... [2025-02-05 12:09:38,316 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:09:38" (1/1) ... [2025-02-05 12:09:38,515 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-02-05 12:09:38,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:09:38,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:09:38,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:09:38,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:09:38,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:09:38" (1/1) ... [2025-02-05 12:09:38,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:09:38" (1/1) ... [2025-02-05 12:09:38,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:09:38" (1/1) ... [2025-02-05 12:09:38,700 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:09:38,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:09:38" (1/1) ... [2025-02-05 12:09:38,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:09:38" (1/1) ... [2025-02-05 12:09:38,783 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:09:38" (1/1) ... [2025-02-05 12:09:38,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:09:38" (1/1) ... [2025-02-05 12:09:38,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:09:38" (1/1) ... [2025-02-05 12:09:38,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:09:38" (1/1) ... [2025-02-05 12:09:38,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:09:38,854 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:09:38,854 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:09:38,855 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:09:38,856 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:09:38" (1/1) ... [2025-02-05 12:09:38,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:09:38,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:09:38,890 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:09:38,896 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:09:38,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:09:38,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:09:38,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:09:38,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:09:38,985 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:09:38,987 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:09:42,624 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1; [2025-02-05 12:09:42,624 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1; [2025-02-05 12:09:42,747 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-02-05 12:09:42,748 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:09:42,785 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:09:42,785 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:09:42,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:09:42 BoogieIcfgContainer [2025-02-05 12:09:42,785 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:09:42,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:09:42,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:09:42,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:09:42,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:09:37" (1/3) ... [2025-02-05 12:09:42,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8b1af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:09:42, skipping insertion in model container [2025-02-05 12:09:42,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:09:38" (2/3) ... [2025-02-05 12:09:42,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8b1af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:09:42, skipping insertion in model container [2025-02-05 12:09:42,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:09:42" (3/3) ... [2025-02-05 12:09:42,798 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label22.c [2025-02-05 12:09:42,814 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:09:42,816 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label22.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:09:42,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:09:42,915 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;@460a9adf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:09:42,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:09:42,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 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:09:42,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 12:09:42,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:09:42,935 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] [2025-02-05 12:09:42,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:09:42,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:09:42,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1536028733, now seen corresponding path program 1 times [2025-02-05 12:09:42,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:09:42,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934529391] [2025-02-05 12:09:42,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:09:42,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:09:43,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 12:09:43,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 12:09:43,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:09:43,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:09:43,404 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:09:43,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:09:43,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934529391] [2025-02-05 12:09:43,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934529391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:09:43,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:09:43,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:09:43,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945968713] [2025-02-05 12:09:43,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:09:43,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:09:43,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:09:43,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:09:43,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:09:43,440 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 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 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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:09:48,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:09:48,178 INFO L93 Difference]: Finished difference Result 2910 states and 5656 transitions. [2025-02-05 12:09:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 12:09:48,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2025-02-05 12:09:48,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:09:48,210 INFO L225 Difference]: With dead ends: 2910 [2025-02-05 12:09:48,211 INFO L226 Difference]: Without dead ends: 2080 [2025-02-05 12:09:48,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:09:48,227 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 2152 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 3390 mSolverCounterSat, 1773 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 5163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1773 IncrementalHoareTripleChecker+Valid, 3390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:09:48,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 168 Invalid, 5163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1773 Valid, 3390 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-05 12:09:48,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2025-02-05 12:09:48,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 2074. [2025-02-05 12:09:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 2073 states have (on average 1.5561987457790643) internal successors, (3226), 2073 states have internal predecessors, (3226), 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:09:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3226 transitions. [2025-02-05 12:09:48,366 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 3226 transitions. Word has length 41 [2025-02-05 12:09:48,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:09:48,367 INFO L471 AbstractCegarLoop]: Abstraction has 2074 states and 3226 transitions. [2025-02-05 12:09:48,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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:09:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 3226 transitions. [2025-02-05 12:09:48,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 12:09:48,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:09:48,374 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, 2, 2, 2, 2, 2, 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] [2025-02-05 12:09:48,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:09:48,375 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:09:48,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:09:48,376 INFO L85 PathProgramCache]: Analyzing trace with hash 345833922, now seen corresponding path program 1 times [2025-02-05 12:09:48,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:09:48,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742692273] [2025-02-05 12:09:48,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:09:48,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:09:48,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 12:09:48,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 12:09:48,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:09:48,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:09:49,100 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-05 12:09:49,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:09:49,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742692273] [2025-02-05 12:09:49,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742692273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:09:49,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:09:49,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:09:49,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468542403] [2025-02-05 12:09:49,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:09:49,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:09:49,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:09:49,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:09:49,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:09:49,105 INFO L87 Difference]: Start difference. First operand 2074 states and 3226 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 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:09:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:09:53,082 INFO L93 Difference]: Finished difference Result 6908 states and 10880 transitions. [2025-02-05 12:09:53,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:09:53,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 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 201 [2025-02-05 12:09:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:09:53,104 INFO L225 Difference]: With dead ends: 6908 [2025-02-05 12:09:53,104 INFO L226 Difference]: Without dead ends: 4836 [2025-02-05 12:09:53,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:09:53,109 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 1925 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4332 mSolverCounterSat, 627 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1925 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 4959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 627 IncrementalHoareTripleChecker+Valid, 4332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:09:53,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1925 Valid, 622 Invalid, 4959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [627 Valid, 4332 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-02-05 12:09:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4836 states. [2025-02-05 12:09:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4836 to 4144. [2025-02-05 12:09:53,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4143 states have (on average 1.3408158339367608) internal successors, (5555), 4143 states have internal predecessors, (5555), 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:09:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5555 transitions. [2025-02-05 12:09:53,227 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5555 transitions. Word has length 201 [2025-02-05 12:09:53,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:09:53,232 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5555 transitions. [2025-02-05 12:09:53,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 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:09:53,232 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5555 transitions. [2025-02-05 12:09:53,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-02-05 12:09:53,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:09:53,238 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:09:53,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:09:53,238 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:09:53,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:09:53,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1466421943, now seen corresponding path program 1 times [2025-02-05 12:09:53,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:09:53,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543224609] [2025-02-05 12:09:53,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:09:53,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:09:53,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-02-05 12:09:53,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-02-05 12:09:53,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:09:53,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:09:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:09:53,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:09:53,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543224609] [2025-02-05 12:09:53,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543224609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:09:53,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:09:53,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:09:53,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769227785] [2025-02-05 12:09:53,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:09:53,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:09:53,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:09:53,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:09:53,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:09:53,894 INFO L87 Difference]: Start difference. First operand 4144 states and 5555 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:09:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:09:56,498 INFO L93 Difference]: Finished difference Result 10409 states and 13873 transitions. [2025-02-05 12:09:56,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:09:56,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 290 [2025-02-05 12:09:56,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:09:56,518 INFO L225 Difference]: With dead ends: 10409 [2025-02-05 12:09:56,518 INFO L226 Difference]: Without dead ends: 6214 [2025-02-05 12:09:56,524 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:09:56,524 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 513 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 3725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 3037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:09:56,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 637 Invalid, 3725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 12:09:56,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6214 states. [2025-02-05 12:09:56,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6214 to 5524. [2025-02-05 12:09:56,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 5523 states have (on average 1.196270143038204) internal successors, (6607), 5523 states have internal predecessors, (6607), 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:09:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 6607 transitions. [2025-02-05 12:09:56,616 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 6607 transitions. Word has length 290 [2025-02-05 12:09:56,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:09:56,617 INFO L471 AbstractCegarLoop]: Abstraction has 5524 states and 6607 transitions. [2025-02-05 12:09:56,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:09:56,617 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 6607 transitions. [2025-02-05 12:09:56,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2025-02-05 12:09:56,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:09:56,640 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:56,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:09:56,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:09:56,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:09:56,642 INFO L85 PathProgramCache]: Analyzing trace with hash -193025874, now seen corresponding path program 1 times [2025-02-05 12:09:56,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:09:56,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890516201] [2025-02-05 12:09:56,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:09:56,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:09:56,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 922 statements into 1 equivalence classes. [2025-02-05 12:09:56,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 922 of 922 statements. [2025-02-05 12:09:56,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:09:56,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:09:57,755 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-02-05 12:09:57,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:09:57,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890516201] [2025-02-05 12:09:57,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890516201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:09:57,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:09:57,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:09:57,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483713282] [2025-02-05 12:09:57,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:09:57,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:09:57,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:09:57,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:09:57,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:09:57,759 INFO L87 Difference]: Start difference. First operand 5524 states and 6607 transitions. Second operand has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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:09:59,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:09:59,721 INFO L93 Difference]: Finished difference Result 15186 states and 18423 transitions. [2025-02-05 12:09:59,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:09:59,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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 922 [2025-02-05 12:09:59,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:09:59,742 INFO L225 Difference]: With dead ends: 15186 [2025-02-05 12:09:59,742 INFO L226 Difference]: Without dead ends: 9664 [2025-02-05 12:09:59,749 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:09:59,749 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 644 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 2513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:09:59,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 105 Invalid, 2513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:09:59,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9664 states. [2025-02-05 12:09:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9664 to 8974. [2025-02-05 12:09:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8974 states, 8973 states have (on average 1.2178758497715367) internal successors, (10928), 8973 states have internal predecessors, (10928), 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:09:59,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8974 states to 8974 states and 10928 transitions. [2025-02-05 12:09:59,890 INFO L78 Accepts]: Start accepts. Automaton has 8974 states and 10928 transitions. Word has length 922 [2025-02-05 12:09:59,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:09:59,894 INFO L471 AbstractCegarLoop]: Abstraction has 8974 states and 10928 transitions. [2025-02-05 12:09:59,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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:09:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 8974 states and 10928 transitions. [2025-02-05 12:09:59,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 941 [2025-02-05 12:09:59,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:09:59,925 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:59,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:09:59,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:09:59,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:09:59,927 INFO L85 PathProgramCache]: Analyzing trace with hash 378576667, now seen corresponding path program 1 times [2025-02-05 12:09:59,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:09:59,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444511585] [2025-02-05 12:09:59,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:09:59,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:00,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 940 statements into 1 equivalence classes. [2025-02-05 12:10:00,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 940 of 940 statements. [2025-02-05 12:10:00,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:00,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2025-02-05 12:10:00,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:00,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444511585] [2025-02-05 12:10:00,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444511585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:00,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:00,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:10:00,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199201464] [2025-02-05 12:10:00,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:00,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:00,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:00,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:00,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:00,931 INFO L87 Difference]: Start difference. First operand 8974 states and 10928 transitions. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 2 states have internal predecessors, (559), 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:10:03,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:03,073 INFO L93 Difference]: Finished difference Result 20016 states and 24612 transitions. [2025-02-05 12:10:03,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:03,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 2 states have internal predecessors, (559), 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 940 [2025-02-05 12:10:03,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:03,108 INFO L225 Difference]: With dead ends: 20016 [2025-02-05 12:10:03,108 INFO L226 Difference]: Without dead ends: 11044 [2025-02-05 12:10:03,120 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:10:03,121 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 249 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:03,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 77 Invalid, 2478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:10:03,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11044 states. [2025-02-05 12:10:03,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11044 to 11044. [2025-02-05 12:10:03,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11044 states, 11043 states have (on average 1.2193244589332608) internal successors, (13465), 11043 states have internal predecessors, (13465), 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:10:03,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11044 states to 11044 states and 13465 transitions. [2025-02-05 12:10:03,307 INFO L78 Accepts]: Start accepts. Automaton has 11044 states and 13465 transitions. Word has length 940 [2025-02-05 12:10:03,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:03,310 INFO L471 AbstractCegarLoop]: Abstraction has 11044 states and 13465 transitions. [2025-02-05 12:10:03,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 2 states have internal predecessors, (559), 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:10:03,314 INFO L276 IsEmpty]: Start isEmpty. Operand 11044 states and 13465 transitions. [2025-02-05 12:10:03,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1002 [2025-02-05 12:10:03,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:03,333 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:03,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:10:03,333 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:03,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:03,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1048779838, now seen corresponding path program 1 times [2025-02-05 12:10:03,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:03,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431822077] [2025-02-05 12:10:03,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:03,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:03,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1001 statements into 1 equivalence classes. [2025-02-05 12:10:03,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1001 of 1001 statements. [2025-02-05 12:10:03,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:03,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2025-02-05 12:10:04,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:04,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431822077] [2025-02-05 12:10:04,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431822077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:04,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:04,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:10:04,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118337994] [2025-02-05 12:10:04,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:04,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:04,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:04,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:04,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:04,040 INFO L87 Difference]: Start difference. First operand 11044 states and 13465 transitions. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 2 states have internal predecessors, (559), 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:10:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:05,897 INFO L93 Difference]: Finished difference Result 26916 states and 33821 transitions. [2025-02-05 12:10:05,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:05,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 2 states have internal predecessors, (559), 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 1001 [2025-02-05 12:10:05,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:05,931 INFO L225 Difference]: With dead ends: 26916 [2025-02-05 12:10:05,931 INFO L226 Difference]: Without dead ends: 15874 [2025-02-05 12:10:05,946 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:10:05,946 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 226 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:05,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 389 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:10:05,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15874 states. [2025-02-05 12:10:06,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15874 to 14494. [2025-02-05 12:10:06,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14494 states, 14493 states have (on average 1.183743876354102) internal successors, (17156), 14493 states have internal predecessors, (17156), 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:10:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14494 states to 14494 states and 17156 transitions. [2025-02-05 12:10:06,144 INFO L78 Accepts]: Start accepts. Automaton has 14494 states and 17156 transitions. Word has length 1001 [2025-02-05 12:10:06,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:06,145 INFO L471 AbstractCegarLoop]: Abstraction has 14494 states and 17156 transitions. [2025-02-05 12:10:06,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 2 states have internal predecessors, (559), 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:10:06,146 INFO L276 IsEmpty]: Start isEmpty. Operand 14494 states and 17156 transitions. [2025-02-05 12:10:06,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1027 [2025-02-05 12:10:06,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:06,156 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:06,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:10:06,156 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:06,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:06,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1737354882, now seen corresponding path program 1 times [2025-02-05 12:10:06,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:06,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130606644] [2025-02-05 12:10:06,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:06,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:06,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1026 statements into 1 equivalence classes. [2025-02-05 12:10:06,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1026 of 1026 statements. [2025-02-05 12:10:06,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:06,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 878 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-02-05 12:10:06,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:06,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130606644] [2025-02-05 12:10:06,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130606644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:06,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:06,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:06,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990713246] [2025-02-05 12:10:06,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:06,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:06,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:06,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:06,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:06,898 INFO L87 Difference]: Start difference. First operand 14494 states and 17156 transitions. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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:10:08,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:08,832 INFO L93 Difference]: Finished difference Result 35196 states and 41986 transitions. [2025-02-05 12:10:08,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:08,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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 1026 [2025-02-05 12:10:08,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:08,880 INFO L225 Difference]: With dead ends: 35196 [2025-02-05 12:10:08,880 INFO L226 Difference]: Without dead ends: 20704 [2025-02-05 12:10:08,899 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:10:08,901 INFO L435 NwaCegarLoop]: 1117 mSDtfsCounter, 653 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 2402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:08,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1124 Invalid, 2402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:10:08,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20704 states. [2025-02-05 12:10:09,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20704 to 20014. [2025-02-05 12:10:09,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20014 states, 20013 states have (on average 1.1647429171038826) internal successors, (23310), 20013 states have internal predecessors, (23310), 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:10:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20014 states to 20014 states and 23310 transitions. [2025-02-05 12:10:09,196 INFO L78 Accepts]: Start accepts. Automaton has 20014 states and 23310 transitions. Word has length 1026 [2025-02-05 12:10:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:09,197 INFO L471 AbstractCegarLoop]: Abstraction has 20014 states and 23310 transitions. [2025-02-05 12:10:09,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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:10:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 20014 states and 23310 transitions. [2025-02-05 12:10:09,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1134 [2025-02-05 12:10:09,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:09,210 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:09,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:10:09,212 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:09,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:09,213 INFO L85 PathProgramCache]: Analyzing trace with hash -305954156, now seen corresponding path program 1 times [2025-02-05 12:10:09,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:09,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249064917] [2025-02-05 12:10:09,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:09,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:09,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1133 statements into 1 equivalence classes. [2025-02-05 12:10:09,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1133 of 1133 statements. [2025-02-05 12:10:09,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:09,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 830 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-02-05 12:10:10,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:10,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249064917] [2025-02-05 12:10:10,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249064917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:10,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:10,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:10,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410417149] [2025-02-05 12:10:10,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:10,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:10,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:10,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:10,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:10,245 INFO L87 Difference]: Start difference. First operand 20014 states and 23310 transitions. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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:10:12,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:12,009 INFO L93 Difference]: Finished difference Result 45546 states and 53216 transitions. [2025-02-05 12:10:12,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:12,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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 1133 [2025-02-05 12:10:12,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:12,068 INFO L225 Difference]: With dead ends: 45546 [2025-02-05 12:10:12,068 INFO L226 Difference]: Without dead ends: 25534 [2025-02-05 12:10:12,090 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:10:12,091 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 574 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 2243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:12,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 1017 Invalid, 2243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1985 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:10:12,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25534 states. [2025-02-05 12:10:12,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25534 to 25534. [2025-02-05 12:10:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25534 states, 25533 states have (on average 1.149727803235029) internal successors, (29356), 25533 states have internal predecessors, (29356), 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:10:12,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25534 states to 25534 states and 29356 transitions. [2025-02-05 12:10:12,392 INFO L78 Accepts]: Start accepts. Automaton has 25534 states and 29356 transitions. Word has length 1133 [2025-02-05 12:10:12,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:12,393 INFO L471 AbstractCegarLoop]: Abstraction has 25534 states and 29356 transitions. [2025-02-05 12:10:12,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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:10:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand 25534 states and 29356 transitions. [2025-02-05 12:10:12,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1141 [2025-02-05 12:10:12,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:12,497 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:12,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:10:12,497 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:12,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:12,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1805598261, now seen corresponding path program 1 times [2025-02-05 12:10:12,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:12,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659140249] [2025-02-05 12:10:12,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:12,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:12,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1140 statements into 1 equivalence classes. [2025-02-05 12:10:12,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1140 of 1140 statements. [2025-02-05 12:10:12,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:12,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:13,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 703 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-02-05 12:10:13,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:13,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659140249] [2025-02-05 12:10:13,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659140249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:13,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:13,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 12:10:13,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083385671] [2025-02-05 12:10:13,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:13,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 12:10:13,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:13,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 12:10:13,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:10:13,658 INFO L87 Difference]: Start difference. First operand 25534 states and 29356 transitions. Second operand has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 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:10:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:15,912 INFO L93 Difference]: Finished difference Result 58045 states and 66731 transitions. [2025-02-05 12:10:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:10:15,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 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 1140 [2025-02-05 12:10:15,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:15,956 INFO L225 Difference]: With dead ends: 58045 [2025-02-05 12:10:15,957 INFO L226 Difference]: Without dead ends: 28373 [2025-02-05 12:10:15,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:10:15,981 INFO L435 NwaCegarLoop]: 1108 mSDtfsCounter, 2038 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 1070 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2038 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 3556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1070 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:15,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2038 Valid, 1117 Invalid, 3556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1070 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:10:16,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28373 states. [2025-02-05 12:10:16,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28373 to 27604. [2025-02-05 12:10:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27604 states, 27603 states have (on average 1.0893381154222368) internal successors, (30069), 27603 states have internal predecessors, (30069), 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:10:16,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27604 states to 27604 states and 30069 transitions. [2025-02-05 12:10:16,391 INFO L78 Accepts]: Start accepts. Automaton has 27604 states and 30069 transitions. Word has length 1140 [2025-02-05 12:10:16,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:16,392 INFO L471 AbstractCegarLoop]: Abstraction has 27604 states and 30069 transitions. [2025-02-05 12:10:16,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 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:10:16,392 INFO L276 IsEmpty]: Start isEmpty. Operand 27604 states and 30069 transitions. [2025-02-05 12:10:16,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1145 [2025-02-05 12:10:16,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:16,407 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:16,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 12:10:16,408 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:16,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:16,409 INFO L85 PathProgramCache]: Analyzing trace with hash 446596988, now seen corresponding path program 1 times [2025-02-05 12:10:16,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:16,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089233030] [2025-02-05 12:10:16,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:16,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:16,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1144 statements into 1 equivalence classes. [2025-02-05 12:10:16,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1144 of 1144 statements. [2025-02-05 12:10:16,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:16,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1320 backedges. 853 proven. 0 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2025-02-05 12:10:17,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:17,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089233030] [2025-02-05 12:10:17,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089233030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:17,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:17,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:17,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337084389] [2025-02-05 12:10:17,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:17,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:17,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:17,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:17,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:17,378 INFO L87 Difference]: Start difference. First operand 27604 states and 30069 transitions. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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:10:18,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:18,882 INFO L93 Difference]: Finished difference Result 58656 states and 64038 transitions. [2025-02-05 12:10:18,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:18,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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 1144 [2025-02-05 12:10:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:18,917 INFO L225 Difference]: With dead ends: 58656 [2025-02-05 12:10:18,917 INFO L226 Difference]: Without dead ends: 31054 [2025-02-05 12:10:18,938 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:10:18,939 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 587 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:18,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 227 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:10:18,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31054 states. [2025-02-05 12:10:19,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31054 to 31054. [2025-02-05 12:10:19,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31054 states, 31053 states have (on average 1.0856277976362991) internal successors, (33712), 31053 states have internal predecessors, (33712), 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:10:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31054 states to 31054 states and 33712 transitions. [2025-02-05 12:10:19,367 INFO L78 Accepts]: Start accepts. Automaton has 31054 states and 33712 transitions. Word has length 1144 [2025-02-05 12:10:19,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:19,369 INFO L471 AbstractCegarLoop]: Abstraction has 31054 states and 33712 transitions. [2025-02-05 12:10:19,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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:10:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 31054 states and 33712 transitions. [2025-02-05 12:10:19,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1200 [2025-02-05 12:10:19,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:19,396 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:19,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 12:10:19,397 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:19,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:19,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1899910489, now seen corresponding path program 1 times [2025-02-05 12:10:19,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:19,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410794116] [2025-02-05 12:10:19,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:19,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:19,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1199 statements into 1 equivalence classes. [2025-02-05 12:10:19,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1199 of 1199 statements. [2025-02-05 12:10:19,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:19,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1453 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 1259 trivial. 0 not checked. [2025-02-05 12:10:20,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:20,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410794116] [2025-02-05 12:10:20,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410794116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:20,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:20,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:20,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315852968] [2025-02-05 12:10:20,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:20,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:20,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:20,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:20,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:20,175 INFO L87 Difference]: Start difference. First operand 31054 states and 33712 transitions. Second operand has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:10:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:21,939 INFO L93 Difference]: Finished difference Result 80046 states and 87332 transitions. [2025-02-05 12:10:21,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:21,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1199 [2025-02-05 12:10:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:21,986 INFO L225 Difference]: With dead ends: 80046 [2025-02-05 12:10:21,986 INFO L226 Difference]: Without dead ends: 48994 [2025-02-05 12:10:22,011 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:10:22,012 INFO L435 NwaCegarLoop]: 915 mSDtfsCounter, 678 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:22,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 922 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:10:22,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48994 states. [2025-02-05 12:10:22,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48994 to 47614. [2025-02-05 12:10:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47614 states, 47613 states have (on average 1.075714615756201) internal successors, (51218), 47613 states have internal predecessors, (51218), 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:10:22,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47614 states to 47614 states and 51218 transitions. [2025-02-05 12:10:22,508 INFO L78 Accepts]: Start accepts. Automaton has 47614 states and 51218 transitions. Word has length 1199 [2025-02-05 12:10:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:22,509 INFO L471 AbstractCegarLoop]: Abstraction has 47614 states and 51218 transitions. [2025-02-05 12:10:22,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:10:22,509 INFO L276 IsEmpty]: Start isEmpty. Operand 47614 states and 51218 transitions. [2025-02-05 12:10:22,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1224 [2025-02-05 12:10:22,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:22,524 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:22,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 12:10:22,524 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:22,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:22,525 INFO L85 PathProgramCache]: Analyzing trace with hash 961667032, now seen corresponding path program 1 times [2025-02-05 12:10:22,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:22,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604376162] [2025-02-05 12:10:22,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:22,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:22,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1223 statements into 1 equivalence classes. [2025-02-05 12:10:22,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1223 of 1223 statements. [2025-02-05 12:10:22,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:22,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1780 backedges. 1148 proven. 0 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2025-02-05 12:10:23,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:23,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604376162] [2025-02-05 12:10:23,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604376162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:23,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:23,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:23,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104820742] [2025-02-05 12:10:23,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:23,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:23,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:23,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:23,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:23,142 INFO L87 Difference]: Start difference. First operand 47614 states and 51218 transitions. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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:10:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:24,858 INFO L93 Difference]: Finished difference Result 94536 states and 101740 transitions. [2025-02-05 12:10:24,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:24,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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 1223 [2025-02-05 12:10:24,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:24,904 INFO L225 Difference]: With dead ends: 94536 [2025-02-05 12:10:24,905 INFO L226 Difference]: Without dead ends: 46924 [2025-02-05 12:10:24,915 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:10:24,916 INFO L435 NwaCegarLoop]: 946 mSDtfsCounter, 587 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:24,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 953 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:10:24,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46924 states. [2025-02-05 12:10:25,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46924 to 46924. [2025-02-05 12:10:25,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46924 states, 46923 states have (on average 1.0638919080195213) internal successors, (49921), 46923 states have internal predecessors, (49921), 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:10:25,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46924 states to 46924 states and 49921 transitions. [2025-02-05 12:10:25,228 INFO L78 Accepts]: Start accepts. Automaton has 46924 states and 49921 transitions. Word has length 1223 [2025-02-05 12:10:25,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:25,228 INFO L471 AbstractCegarLoop]: Abstraction has 46924 states and 49921 transitions. [2025-02-05 12:10:25,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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:10:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 46924 states and 49921 transitions. [2025-02-05 12:10:25,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1238 [2025-02-05 12:10:25,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:25,240 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:25,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 12:10:25,241 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:25,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:25,241 INFO L85 PathProgramCache]: Analyzing trace with hash 628340577, now seen corresponding path program 1 times [2025-02-05 12:10:25,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:25,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495676410] [2025-02-05 12:10:25,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:25,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:25,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1237 statements into 1 equivalence classes. [2025-02-05 12:10:25,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1237 of 1237 statements. [2025-02-05 12:10:25,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:25,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1790 backedges. 1087 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-05 12:10:25,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:25,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495676410] [2025-02-05 12:10:25,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495676410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:25,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:25,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:25,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648352979] [2025-02-05 12:10:25,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:25,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:25,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:25,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:25,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:25,776 INFO L87 Difference]: Start difference. First operand 46924 states and 49921 transitions. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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:10:27,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:27,538 INFO L93 Difference]: Finished difference Result 113856 states and 121866 transitions. [2025-02-05 12:10:27,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:27,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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 1237 [2025-02-05 12:10:27,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:27,607 INFO L225 Difference]: With dead ends: 113856 [2025-02-05 12:10:27,607 INFO L226 Difference]: Without dead ends: 66934 [2025-02-05 12:10:27,637 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:10:27,637 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 646 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:27,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 875 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:10:27,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66934 states. [2025-02-05 12:10:28,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66934 to 66934. [2025-02-05 12:10:28,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66934 states, 66933 states have (on average 1.0558917126081304) internal successors, (70674), 66933 states have internal predecessors, (70674), 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:10:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66934 states to 66934 states and 70674 transitions. [2025-02-05 12:10:28,151 INFO L78 Accepts]: Start accepts. Automaton has 66934 states and 70674 transitions. Word has length 1237 [2025-02-05 12:10:28,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:28,152 INFO L471 AbstractCegarLoop]: Abstraction has 66934 states and 70674 transitions. [2025-02-05 12:10:28,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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:10:28,152 INFO L276 IsEmpty]: Start isEmpty. Operand 66934 states and 70674 transitions. [2025-02-05 12:10:28,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1256 [2025-02-05 12:10:28,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:28,166 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:28,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 12:10:28,167 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:28,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:28,167 INFO L85 PathProgramCache]: Analyzing trace with hash 457851237, now seen corresponding path program 1 times [2025-02-05 12:10:28,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:28,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928278555] [2025-02-05 12:10:28,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:28,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:28,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1255 statements into 1 equivalence classes. [2025-02-05 12:10:28,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1255 of 1255 statements. [2025-02-05 12:10:28,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:28,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:28,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 549 proven. 0 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2025-02-05 12:10:28,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:28,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928278555] [2025-02-05 12:10:28,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928278555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:28,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:28,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:28,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634011721] [2025-02-05 12:10:28,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:28,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:28,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:28,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:28,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:28,901 INFO L87 Difference]: Start difference. First operand 66934 states and 70674 transitions. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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:10:30,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:30,745 INFO L93 Difference]: Finished difference Result 138696 states and 146228 transitions. [2025-02-05 12:10:30,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:30,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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 1255 [2025-02-05 12:10:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:30,825 INFO L225 Difference]: With dead ends: 138696 [2025-02-05 12:10:30,825 INFO L226 Difference]: Without dead ends: 66934 [2025-02-05 12:10:30,868 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:10:30,869 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 620 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:30,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 934 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:10:30,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66934 states. [2025-02-05 12:10:31,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66934 to 65554. [2025-02-05 12:10:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65554 states, 65553 states have (on average 1.0379845316003844) internal successors, (68043), 65553 states have internal predecessors, (68043), 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:10:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65554 states to 65554 states and 68043 transitions. [2025-02-05 12:10:31,623 INFO L78 Accepts]: Start accepts. Automaton has 65554 states and 68043 transitions. Word has length 1255 [2025-02-05 12:10:31,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:31,624 INFO L471 AbstractCegarLoop]: Abstraction has 65554 states and 68043 transitions. [2025-02-05 12:10:31,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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:10:31,624 INFO L276 IsEmpty]: Start isEmpty. Operand 65554 states and 68043 transitions. [2025-02-05 12:10:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1364 [2025-02-05 12:10:31,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:31,640 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:31,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 12:10:31,640 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:31,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:31,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1273943396, now seen corresponding path program 1 times [2025-02-05 12:10:31,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:31,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919988919] [2025-02-05 12:10:31,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:31,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:31,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1363 statements into 1 equivalence classes. [2025-02-05 12:10:31,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1363 of 1363 statements. [2025-02-05 12:10:31,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:31,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:32,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 1352 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2025-02-05 12:10:32,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:32,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919988919] [2025-02-05 12:10:32,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919988919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:32,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:32,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:32,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139019214] [2025-02-05 12:10:32,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:32,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:10:32,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:32,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:10:32,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:10:32,670 INFO L87 Difference]: Start difference. First operand 65554 states and 68043 transitions. Second operand has 4 states, 4 states have (on average 208.75) internal successors, (835), 3 states have internal predecessors, (835), 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:10:34,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:34,943 INFO L93 Difference]: Finished difference Result 131796 states and 136795 transitions. [2025-02-05 12:10:34,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:10:34,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 208.75) internal successors, (835), 3 states have internal predecessors, (835), 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 1363 [2025-02-05 12:10:34,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:35,010 INFO L225 Difference]: With dead ends: 131796 [2025-02-05 12:10:35,010 INFO L226 Difference]: Without dead ends: 66934 [2025-02-05 12:10:35,049 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:10:35,049 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 801 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2721 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 2945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 2721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:35,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 69 Invalid, 2945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 2721 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:10:35,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66934 states. [2025-02-05 12:10:35,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66934 to 64864. [2025-02-05 12:10:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64864 states, 64863 states have (on average 1.0381265128039099) internal successors, (67336), 64863 states have internal predecessors, (67336), 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:10:35,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64864 states to 64864 states and 67336 transitions. [2025-02-05 12:10:35,590 INFO L78 Accepts]: Start accepts. Automaton has 64864 states and 67336 transitions. Word has length 1363 [2025-02-05 12:10:35,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:35,591 INFO L471 AbstractCegarLoop]: Abstraction has 64864 states and 67336 transitions. [2025-02-05 12:10:35,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 208.75) internal successors, (835), 3 states have internal predecessors, (835), 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:10:35,591 INFO L276 IsEmpty]: Start isEmpty. Operand 64864 states and 67336 transitions. [2025-02-05 12:10:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1443 [2025-02-05 12:10:35,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:35,611 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:35,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 12:10:35,611 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:35,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:35,612 INFO L85 PathProgramCache]: Analyzing trace with hash -428227704, now seen corresponding path program 1 times [2025-02-05 12:10:35,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:35,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973681578] [2025-02-05 12:10:35,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:35,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:35,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1442 statements into 1 equivalence classes. [2025-02-05 12:10:35,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1442 of 1442 statements. [2025-02-05 12:10:35,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:35,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2383 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 2150 trivial. 0 not checked. [2025-02-05 12:10:36,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:36,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973681578] [2025-02-05 12:10:36,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973681578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:36,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:36,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:36,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137582236] [2025-02-05 12:10:36,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:36,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:36,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:36,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:36,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:36,484 INFO L87 Difference]: Start difference. First operand 64864 states and 67336 transitions. Second operand has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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:10:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:38,234 INFO L93 Difference]: Finished difference Result 129036 states and 133979 transitions. [2025-02-05 12:10:38,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:38,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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 1442 [2025-02-05 12:10:38,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:38,295 INFO L225 Difference]: With dead ends: 129036 [2025-02-05 12:10:38,296 INFO L226 Difference]: Without dead ends: 64864 [2025-02-05 12:10:38,324 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:10:38,324 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 718 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:38,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 889 Invalid, 1827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:10:38,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64864 states. [2025-02-05 12:10:38,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64864 to 64174. [2025-02-05 12:10:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64174 states, 64173 states have (on average 1.0267246349710937) internal successors, (65888), 64173 states have internal predecessors, (65888), 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:10:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64174 states to 64174 states and 65888 transitions. [2025-02-05 12:10:38,800 INFO L78 Accepts]: Start accepts. Automaton has 64174 states and 65888 transitions. Word has length 1442 [2025-02-05 12:10:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:38,801 INFO L471 AbstractCegarLoop]: Abstraction has 64174 states and 65888 transitions. [2025-02-05 12:10:38,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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:10:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand 64174 states and 65888 transitions. [2025-02-05 12:10:38,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1516 [2025-02-05 12:10:38,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:38,822 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:38,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 12:10:38,822 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:38,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:38,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2100707280, now seen corresponding path program 1 times [2025-02-05 12:10:38,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:38,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555364870] [2025-02-05 12:10:38,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:38,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:38,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1515 statements into 1 equivalence classes. [2025-02-05 12:10:38,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1515 of 1515 statements. [2025-02-05 12:10:38,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:38,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2130 backedges. 553 proven. 0 refuted. 0 times theorem prover too weak. 1577 trivial. 0 not checked. [2025-02-05 12:10:39,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:39,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555364870] [2025-02-05 12:10:39,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555364870] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:39,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:39,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:39,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987955741] [2025-02-05 12:10:39,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:39,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:39,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:39,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:39,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:39,687 INFO L87 Difference]: Start difference. First operand 64174 states and 65888 transitions. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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:10:41,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:41,255 INFO L93 Difference]: Finished difference Result 128346 states and 131779 transitions. [2025-02-05 12:10:41,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:41,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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 1515 [2025-02-05 12:10:41,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:41,468 INFO L225 Difference]: With dead ends: 128346 [2025-02-05 12:10:41,468 INFO L226 Difference]: Without dead ends: 64864 [2025-02-05 12:10:41,481 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:10:41,481 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 619 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:41,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 67 Invalid, 1978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:10:41,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64864 states. [2025-02-05 12:10:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64864 to 64174. [2025-02-05 12:10:41,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64174 states, 64173 states have (on average 1.026101319869727) internal successors, (65848), 64173 states have internal predecessors, (65848), 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:10:41,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64174 states to 64174 states and 65848 transitions. [2025-02-05 12:10:41,964 INFO L78 Accepts]: Start accepts. Automaton has 64174 states and 65848 transitions. Word has length 1515 [2025-02-05 12:10:41,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:41,965 INFO L471 AbstractCegarLoop]: Abstraction has 64174 states and 65848 transitions. [2025-02-05 12:10:41,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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:10:41,965 INFO L276 IsEmpty]: Start isEmpty. Operand 64174 states and 65848 transitions. [2025-02-05 12:10:42,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1583 [2025-02-05 12:10:42,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:42,003 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:42,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 12:10:42,003 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:42,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:42,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1635255453, now seen corresponding path program 1 times [2025-02-05 12:10:42,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:42,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912697260] [2025-02-05 12:10:42,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:42,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:42,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1582 statements into 1 equivalence classes. [2025-02-05 12:10:42,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1582 of 1582 statements. [2025-02-05 12:10:42,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:42,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2331 backedges. 1866 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-05 12:10:43,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:43,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912697260] [2025-02-05 12:10:43,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912697260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:43,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:43,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:43,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984689796] [2025-02-05 12:10:43,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:43,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:43,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:43,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:43,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:43,169 INFO L87 Difference]: Start difference. First operand 64174 states and 65848 transitions. Second operand has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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:10:44,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:44,917 INFO L93 Difference]: Finished difference Result 135936 states and 139629 transitions. [2025-02-05 12:10:44,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:44,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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 1582 [2025-02-05 12:10:44,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:44,992 INFO L225 Difference]: With dead ends: 135936 [2025-02-05 12:10:44,992 INFO L226 Difference]: Without dead ends: 72454 [2025-02-05 12:10:45,034 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:10:45,034 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 344 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:45,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 197 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:10:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72454 states. [2025-02-05 12:10:45,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72454 to 71074. [2025-02-05 12:10:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71074 states, 71073 states have (on average 1.022343224571919) internal successors, (72661), 71073 states have internal predecessors, (72661), 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:10:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71074 states to 71074 states and 72661 transitions. [2025-02-05 12:10:45,834 INFO L78 Accepts]: Start accepts. Automaton has 71074 states and 72661 transitions. Word has length 1582 [2025-02-05 12:10:45,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:45,835 INFO L471 AbstractCegarLoop]: Abstraction has 71074 states and 72661 transitions. [2025-02-05 12:10:45,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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:10:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 71074 states and 72661 transitions. [2025-02-05 12:10:45,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1906 [2025-02-05 12:10:45,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:45,917 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:45,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 12:10:45,918 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:45,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:45,919 INFO L85 PathProgramCache]: Analyzing trace with hash -645646379, now seen corresponding path program 1 times [2025-02-05 12:10:45,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:45,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842650849] [2025-02-05 12:10:45,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:45,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:45,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1905 statements into 1 equivalence classes. [2025-02-05 12:10:46,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1905 of 1905 statements. [2025-02-05 12:10:46,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:46,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 2592 proven. 0 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2025-02-05 12:10:47,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:47,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842650849] [2025-02-05 12:10:47,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842650849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:47,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:47,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:47,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282907177] [2025-02-05 12:10:47,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:47,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:47,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:47,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:47,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:47,128 INFO L87 Difference]: Start difference. First operand 71074 states and 72661 transitions. Second operand has 3 states, 3 states have (on average 386.6666666666667) internal successors, (1160), 3 states have internal predecessors, (1160), 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:10:49,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:49,035 INFO L93 Difference]: Finished difference Result 158706 states and 162426 transitions. [2025-02-05 12:10:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:49,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 386.6666666666667) internal successors, (1160), 3 states have internal predecessors, (1160), 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 1905 [2025-02-05 12:10:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:49,150 INFO L225 Difference]: With dead ends: 158706 [2025-02-05 12:10:49,150 INFO L226 Difference]: Without dead ends: 88324 [2025-02-05 12:10:49,200 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:10:49,200 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 366 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1745 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:49,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 154 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1745 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:10:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88324 states. [2025-02-05 12:10:49,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88324 to 86254. [2025-02-05 12:10:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86254 states, 86253 states have (on average 1.0226658782882914) internal successors, (88208), 86253 states have internal predecessors, (88208), 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:10:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86254 states to 86254 states and 88208 transitions. [2025-02-05 12:10:50,425 INFO L78 Accepts]: Start accepts. Automaton has 86254 states and 88208 transitions. Word has length 1905 [2025-02-05 12:10:50,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:50,426 INFO L471 AbstractCegarLoop]: Abstraction has 86254 states and 88208 transitions. [2025-02-05 12:10:50,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.6666666666667) internal successors, (1160), 3 states have internal predecessors, (1160), 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:10:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 86254 states and 88208 transitions. [2025-02-05 12:10:50,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1941 [2025-02-05 12:10:50,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:50,472 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:50,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 12:10:50,472 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:50,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:50,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1904567864, now seen corresponding path program 1 times [2025-02-05 12:10:50,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:50,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804262881] [2025-02-05 12:10:50,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:50,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:50,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1940 statements into 1 equivalence classes. [2025-02-05 12:10:50,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1940 of 1940 statements. [2025-02-05 12:10:50,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:50,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat