./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fc3dd6a87fcbbda92d2ef86eac2f1110715a91bf4cd8be375753a9611c0b48d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 08:30:42,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 08:30:42,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 08:30:42,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 08:30:42,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 08:30:42,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 08:30:42,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 08:30:42,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 08:30:42,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 08:30:42,159 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 08:30:42,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 08:30:42,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 08:30:42,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 08:30:42,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 08:30:42,161 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 08:30:42,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 08:30:42,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 08:30:42,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 08:30:42,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 08:30:42,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 08:30:42,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 08:30:42,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 08:30:42,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 08:30:42,162 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 08:30:42,162 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 08:30:42,162 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 08:30:42,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 08:30:42,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 08:30:42,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 08:30:42,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:30:42,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 08:30:42,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 08:30:42,163 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 08:30:42,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 08:30:42,163 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 08:30:42,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 08:30:42,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 08:30:42,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 08:30:42,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 08:30:42,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 08:30:42,163 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc3dd6a87fcbbda92d2ef86eac2f1110715a91bf4cd8be375753a9611c0b48d5 [2025-03-08 08:30:42,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 08:30:42,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 08:30:42,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 08:30:42,389 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 08:30:42,389 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 08:30:42,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c [2025-03-08 08:30:43,570 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f5c60264/9949ef2c18f44e65a4546350ef4d5ac9/FLAG9641ab850 [2025-03-08 08:30:43,865 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 08:30:43,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c [2025-03-08 08:30:43,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f5c60264/9949ef2c18f44e65a4546350ef4d5ac9/FLAG9641ab850 [2025-03-08 08:30:44,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f5c60264/9949ef2c18f44e65a4546350ef4d5ac9 [2025-03-08 08:30:44,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 08:30:44,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 08:30:44,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 08:30:44,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 08:30:44,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 08:30:44,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:30:44" (1/1) ... [2025-03-08 08:30:44,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32fb96fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:44, skipping insertion in model container [2025-03-08 08:30:44,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:30:44" (1/1) ... [2025-03-08 08:30:44,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 08:30:44,294 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c[1280,1293] [2025-03-08 08:30:44,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:30:44,477 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 08:30:44,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c[1280,1293] [2025-03-08 08:30:44,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:30:44,574 INFO L204 MainTranslator]: Completed translation [2025-03-08 08:30:44,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:44 WrapperNode [2025-03-08 08:30:44,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 08:30:44,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 08:30:44,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 08:30:44,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 08:30:44,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:44" (1/1) ... [2025-03-08 08:30:44,613 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:44" (1/1) ... [2025-03-08 08:30:44,741 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1976 [2025-03-08 08:30:44,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 08:30:44,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 08:30:44,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 08:30:44,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 08:30:44,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:44" (1/1) ... [2025-03-08 08:30:44,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:44" (1/1) ... [2025-03-08 08:30:44,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:44" (1/1) ... [2025-03-08 08:30:44,871 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 08:30:44,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:44" (1/1) ... [2025-03-08 08:30:44,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:44" (1/1) ... [2025-03-08 08:30:44,910 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:44" (1/1) ... [2025-03-08 08:30:44,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:44" (1/1) ... [2025-03-08 08:30:44,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:44" (1/1) ... [2025-03-08 08:30:44,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:44" (1/1) ... [2025-03-08 08:30:44,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 08:30:44,965 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 08:30:44,966 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 08:30:44,966 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 08:30:44,966 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:44" (1/1) ... [2025-03-08 08:30:44,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:30:44,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:30:44,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 08:30:44,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 08:30:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 08:30:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 08:30:45,016 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 08:30:45,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 08:30:45,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 08:30:45,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 08:30:45,213 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 08:30:45,215 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 08:30:46,779 INFO L? ?]: Removed 1091 outVars from TransFormulas that were not future-live. [2025-03-08 08:30:46,779 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 08:30:46,862 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 08:30:46,862 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 08:30:46,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:30:46 BoogieIcfgContainer [2025-03-08 08:30:46,863 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 08:30:46,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 08:30:46,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 08:30:46,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 08:30:46,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 08:30:44" (1/3) ... [2025-03-08 08:30:46,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf61c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:30:46, skipping insertion in model container [2025-03-08 08:30:46,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:44" (2/3) ... [2025-03-08 08:30:46,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf61c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:30:46, skipping insertion in model container [2025-03-08 08:30:46,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:30:46" (3/3) ... [2025-03-08 08:30:46,874 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c [2025-03-08 08:30:46,884 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 08:30:46,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c that has 2 procedures, 552 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 08:30:46,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 08:30:46,943 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;@304c0277, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 08:30:46,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 08:30:46,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 552 states, 546 states have (on average 1.4945054945054945) internal successors, (816), 547 states have internal predecessors, (816), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 08:30:46,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:46,958 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:46,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:46,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:46,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1072864629, now seen corresponding path program 1 times [2025-03-08 08:30:46,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:46,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719080140] [2025-03-08 08:30:46,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:46,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:47,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 08:30:47,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 08:30:47,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:47,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 08:30:47,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:47,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719080140] [2025-03-08 08:30:47,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719080140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 08:30:47,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468567735] [2025-03-08 08:30:47,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:47,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:30:47,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:30:47,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:30:47,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 08:30:47,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 08:30:47,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 08:30:47,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:47,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:47,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 08:30:47,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:30:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 08:30:47,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 08:30:47,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468567735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:47,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 08:30:47,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 08:30:47,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379350265] [2025-03-08 08:30:47,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:47,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 08:30:47,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:47,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 08:30:47,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 08:30:47,734 INFO L87 Difference]: Start difference. First operand has 552 states, 546 states have (on average 1.4945054945054945) internal successors, (816), 547 states have internal predecessors, (816), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 69.5) internal successors, (139), 2 states have internal predecessors, (139), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 08:30:47,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:47,925 INFO L93 Difference]: Finished difference Result 999 states and 1493 transitions. [2025-03-08 08:30:47,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 08:30:47,927 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 69.5) internal successors, (139), 2 states have internal predecessors, (139), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 149 [2025-03-08 08:30:47,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:47,934 INFO L225 Difference]: With dead ends: 999 [2025-03-08 08:30:47,934 INFO L226 Difference]: Without dead ends: 549 [2025-03-08 08:30:47,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 08:30:47,942 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:47,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 684 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:30:47,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-08 08:30:47,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2025-03-08 08:30:47,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 544 states have (on average 1.4908088235294117) internal successors, (811), 544 states have internal predecessors, (811), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:47,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 817 transitions. [2025-03-08 08:30:47,991 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 817 transitions. Word has length 149 [2025-03-08 08:30:47,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:47,991 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 817 transitions. [2025-03-08 08:30:47,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 69.5) internal successors, (139), 2 states have internal predecessors, (139), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 08:30:47,991 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 817 transitions. [2025-03-08 08:30:47,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 08:30:47,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:47,996 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:48,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 08:30:48,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 08:30:48,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:48,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:48,197 INFO L85 PathProgramCache]: Analyzing trace with hash -786963928, now seen corresponding path program 1 times [2025-03-08 08:30:48,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:48,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834185654] [2025-03-08 08:30:48,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:48,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:48,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 08:30:48,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 08:30:48,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:48,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:30:48,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:48,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834185654] [2025-03-08 08:30:48,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834185654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:48,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:30:48,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:30:48,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580716651] [2025-03-08 08:30:48,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:48,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:30:48,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:48,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:30:48,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:30:48,998 INFO L87 Difference]: Start difference. First operand 549 states and 817 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:49,265 INFO L93 Difference]: Finished difference Result 553 states and 821 transitions. [2025-03-08 08:30:49,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:30:49,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 149 [2025-03-08 08:30:49,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:49,268 INFO L225 Difference]: With dead ends: 553 [2025-03-08 08:30:49,268 INFO L226 Difference]: Without dead ends: 551 [2025-03-08 08:30:49,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:30:49,269 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 0 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:49,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2041 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:30:49,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-08 08:30:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-08 08:30:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.489010989010989) internal successors, (813), 546 states have internal predecessors, (813), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:49,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 819 transitions. [2025-03-08 08:30:49,284 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 819 transitions. Word has length 149 [2025-03-08 08:30:49,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:49,285 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 819 transitions. [2025-03-08 08:30:49,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:49,286 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 819 transitions. [2025-03-08 08:30:49,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 08:30:49,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:49,288 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:49,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 08:30:49,288 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:49,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:49,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1378601643, now seen corresponding path program 1 times [2025-03-08 08:30:49,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:49,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908201742] [2025-03-08 08:30:49,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:49,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:49,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 08:30:49,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 08:30:49,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:49,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:30:49,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:49,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908201742] [2025-03-08 08:30:49,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908201742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:49,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:30:49,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:30:49,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754262500] [2025-03-08 08:30:49,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:49,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:30:49,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:49,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:30:49,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:30:49,678 INFO L87 Difference]: Start difference. First operand 551 states and 819 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:50,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:50,266 INFO L93 Difference]: Finished difference Result 1371 states and 2041 transitions. [2025-03-08 08:30:50,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 08:30:50,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 150 [2025-03-08 08:30:50,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:50,271 INFO L225 Difference]: With dead ends: 1371 [2025-03-08 08:30:50,272 INFO L226 Difference]: Without dead ends: 551 [2025-03-08 08:30:50,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:30:50,274 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 1618 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:50,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1618 Valid, 1968 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:30:50,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-08 08:30:50,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-08 08:30:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.4871794871794872) internal successors, (812), 546 states have internal predecessors, (812), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 818 transitions. [2025-03-08 08:30:50,286 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 818 transitions. Word has length 150 [2025-03-08 08:30:50,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:50,287 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 818 transitions. [2025-03-08 08:30:50,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:50,287 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 818 transitions. [2025-03-08 08:30:50,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 08:30:50,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:50,290 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:50,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 08:30:50,291 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:50,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:50,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1883794798, now seen corresponding path program 1 times [2025-03-08 08:30:50,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:50,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645125584] [2025-03-08 08:30:50,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:50,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:50,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 08:30:50,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 08:30:50,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:50,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:30:50,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:50,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645125584] [2025-03-08 08:30:50,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645125584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:50,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:30:50,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:30:50,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534310015] [2025-03-08 08:30:50,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:50,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:30:50,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:50,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:30:50,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:30:50,626 INFO L87 Difference]: Start difference. First operand 551 states and 818 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:50,862 INFO L93 Difference]: Finished difference Result 1002 states and 1487 transitions. [2025-03-08 08:30:50,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:30:50,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 151 [2025-03-08 08:30:50,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:50,864 INFO L225 Difference]: With dead ends: 1002 [2025-03-08 08:30:50,866 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 08:30:50,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:30:50,867 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 0 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:50,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2035 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:30:50,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 08:30:50,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-08 08:30:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4854014598540146) internal successors, (814), 548 states have internal predecessors, (814), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 820 transitions. [2025-03-08 08:30:50,879 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 820 transitions. Word has length 151 [2025-03-08 08:30:50,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:50,879 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 820 transitions. [2025-03-08 08:30:50,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 820 transitions. [2025-03-08 08:30:50,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 08:30:50,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:50,881 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:50,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 08:30:50,881 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:50,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:50,881 INFO L85 PathProgramCache]: Analyzing trace with hash 199606304, now seen corresponding path program 1 times [2025-03-08 08:30:50,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:50,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743108025] [2025-03-08 08:30:50,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:50,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:50,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 08:30:50,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 08:30:50,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:50,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:30:51,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:51,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743108025] [2025-03-08 08:30:51,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743108025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:51,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:30:51,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:30:51,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430347814] [2025-03-08 08:30:51,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:51,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:30:51,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:51,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:30:51,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:30:51,332 INFO L87 Difference]: Start difference. First operand 553 states and 820 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:51,649 INFO L93 Difference]: Finished difference Result 1004 states and 1488 transitions. [2025-03-08 08:30:51,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:30:51,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 152 [2025-03-08 08:30:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:51,651 INFO L225 Difference]: With dead ends: 1004 [2025-03-08 08:30:51,652 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 08:30:51,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:30:51,654 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 696 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:51,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1236 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:30:51,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 08:30:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-08 08:30:51,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4835766423357664) internal successors, (813), 548 states have internal predecessors, (813), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 819 transitions. [2025-03-08 08:30:51,673 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 819 transitions. Word has length 152 [2025-03-08 08:30:51,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:51,673 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 819 transitions. [2025-03-08 08:30:51,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:51,675 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 819 transitions. [2025-03-08 08:30:51,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 08:30:51,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:51,677 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:51,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 08:30:51,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:51,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:51,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2109374934, now seen corresponding path program 1 times [2025-03-08 08:30:51,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:51,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64822187] [2025-03-08 08:30:51,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:51,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:51,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 08:30:51,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 08:30:51,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:51,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:30:51,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:51,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64822187] [2025-03-08 08:30:51,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64822187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:51,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:30:51,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:30:51,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580660332] [2025-03-08 08:30:51,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:51,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:30:51,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:51,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:30:51,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:30:51,980 INFO L87 Difference]: Start difference. First operand 553 states and 819 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:52,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:52,295 INFO L93 Difference]: Finished difference Result 1008 states and 1491 transitions. [2025-03-08 08:30:52,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:30:52,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 153 [2025-03-08 08:30:52,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:52,299 INFO L225 Difference]: With dead ends: 1008 [2025-03-08 08:30:52,299 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 08:30:52,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:30:52,300 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 703 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 1971 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:52,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 1971 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:30:52,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 08:30:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-08 08:30:52,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4817518248175183) internal successors, (812), 548 states have internal predecessors, (812), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:52,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 818 transitions. [2025-03-08 08:30:52,311 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 818 transitions. Word has length 153 [2025-03-08 08:30:52,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:52,312 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 818 transitions. [2025-03-08 08:30:52,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 818 transitions. [2025-03-08 08:30:52,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 08:30:52,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:52,313 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:52,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 08:30:52,313 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:52,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash -128099050, now seen corresponding path program 1 times [2025-03-08 08:30:52,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:52,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142123294] [2025-03-08 08:30:52,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:52,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:52,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 08:30:52,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 08:30:52,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:52,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:52,597 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:30:52,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:52,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142123294] [2025-03-08 08:30:52,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142123294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:52,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:30:52,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:30:52,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635154905] [2025-03-08 08:30:52,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:52,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:30:52,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:52,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:30:52,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:30:52,600 INFO L87 Difference]: Start difference. First operand 553 states and 818 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:52,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:52,926 INFO L93 Difference]: Finished difference Result 1004 states and 1484 transitions. [2025-03-08 08:30:52,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:30:52,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 154 [2025-03-08 08:30:52,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:52,928 INFO L225 Difference]: With dead ends: 1004 [2025-03-08 08:30:52,928 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 08:30:52,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:30:52,929 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 1495 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:52,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1236 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:30:52,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 08:30:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-08 08:30:52,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.47992700729927) internal successors, (811), 548 states have internal predecessors, (811), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 817 transitions. [2025-03-08 08:30:52,943 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 817 transitions. Word has length 154 [2025-03-08 08:30:52,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:52,943 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 817 transitions. [2025-03-08 08:30:52,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:52,944 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 817 transitions. [2025-03-08 08:30:52,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 08:30:52,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:52,945 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:52,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 08:30:52,945 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:52,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:52,945 INFO L85 PathProgramCache]: Analyzing trace with hash -996749285, now seen corresponding path program 1 times [2025-03-08 08:30:52,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:52,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282444280] [2025-03-08 08:30:52,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:52,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:52,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 08:30:53,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 08:30:53,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:53,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:53,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:30:53,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:53,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282444280] [2025-03-08 08:30:53,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282444280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:53,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:30:53,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:30:53,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459412482] [2025-03-08 08:30:53,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:53,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:30:53,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:53,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:30:53,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:30:53,200 INFO L87 Difference]: Start difference. First operand 553 states and 817 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:53,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:53,479 INFO L93 Difference]: Finished difference Result 1004 states and 1482 transitions. [2025-03-08 08:30:53,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:30:53,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 155 [2025-03-08 08:30:53,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:53,496 INFO L225 Difference]: With dead ends: 1004 [2025-03-08 08:30:53,497 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 08:30:53,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:30:53,498 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 795 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:53,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1243 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:30:53,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 08:30:53,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-08 08:30:53,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4781021897810218) internal successors, (810), 548 states have internal predecessors, (810), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 816 transitions. [2025-03-08 08:30:53,508 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 816 transitions. Word has length 155 [2025-03-08 08:30:53,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:53,508 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 816 transitions. [2025-03-08 08:30:53,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 816 transitions. [2025-03-08 08:30:53,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 08:30:53,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:53,510 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:53,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 08:30:53,510 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:53,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:53,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1970605098, now seen corresponding path program 1 times [2025-03-08 08:30:53,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:53,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371995019] [2025-03-08 08:30:53,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:53,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:53,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 08:30:53,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 08:30:53,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:53,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:53,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:30:53,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:53,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371995019] [2025-03-08 08:30:53,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371995019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:53,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:30:53,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:30:53,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750299945] [2025-03-08 08:30:53,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:53,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:30:53,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:53,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:30:53,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:30:53,762 INFO L87 Difference]: Start difference. First operand 553 states and 816 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:54,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:54,045 INFO L93 Difference]: Finished difference Result 1004 states and 1480 transitions. [2025-03-08 08:30:54,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:30:54,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 156 [2025-03-08 08:30:54,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:54,048 INFO L225 Difference]: With dead ends: 1004 [2025-03-08 08:30:54,048 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 08:30:54,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:30:54,050 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 791 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:54,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1243 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:30:54,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 08:30:54,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-08 08:30:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4762773722627738) internal successors, (809), 548 states have internal predecessors, (809), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 815 transitions. [2025-03-08 08:30:54,060 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 815 transitions. Word has length 156 [2025-03-08 08:30:54,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:54,060 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 815 transitions. [2025-03-08 08:30:54,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 815 transitions. [2025-03-08 08:30:54,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 08:30:54,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:54,063 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:54,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 08:30:54,063 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:54,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:54,064 INFO L85 PathProgramCache]: Analyzing trace with hash -568281898, now seen corresponding path program 1 times [2025-03-08 08:30:54,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:54,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553592914] [2025-03-08 08:30:54,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:54,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:54,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 08:30:54,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 08:30:54,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:54,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:30:54,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:54,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553592914] [2025-03-08 08:30:54,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553592914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:54,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:30:54,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:30:54,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278637886] [2025-03-08 08:30:54,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:54,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:30:54,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:54,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:30:54,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:30:54,330 INFO L87 Difference]: Start difference. First operand 553 states and 815 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:54,603 INFO L93 Difference]: Finished difference Result 1004 states and 1478 transitions. [2025-03-08 08:30:54,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:30:54,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 157 [2025-03-08 08:30:54,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:54,605 INFO L225 Difference]: With dead ends: 1004 [2025-03-08 08:30:54,605 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 08:30:54,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:30:54,607 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 1465 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:54,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 1236 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:30:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 08:30:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-08 08:30:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4744525547445255) internal successors, (808), 548 states have internal predecessors, (808), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 814 transitions. [2025-03-08 08:30:54,616 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 814 transitions. Word has length 157 [2025-03-08 08:30:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:54,616 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 814 transitions. [2025-03-08 08:30:54,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 814 transitions. [2025-03-08 08:30:54,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 08:30:54,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:54,618 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:54,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 08:30:54,618 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:54,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:54,619 INFO L85 PathProgramCache]: Analyzing trace with hash -437642255, now seen corresponding path program 1 times [2025-03-08 08:30:54,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:54,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119397480] [2025-03-08 08:30:54,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:54,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:54,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 08:30:54,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 08:30:54,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:54,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:54,919 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:30:54,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:54,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119397480] [2025-03-08 08:30:54,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119397480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:54,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:30:54,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:30:54,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829122701] [2025-03-08 08:30:54,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:54,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:30:54,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:54,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:30:54,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:30:54,920 INFO L87 Difference]: Start difference. First operand 553 states and 814 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:55,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:55,222 INFO L93 Difference]: Finished difference Result 1004 states and 1476 transitions. [2025-03-08 08:30:55,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:30:55,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 158 [2025-03-08 08:30:55,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:55,225 INFO L225 Difference]: With dead ends: 1004 [2025-03-08 08:30:55,225 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 08:30:55,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:30:55,226 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 783 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:55,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1243 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:30:55,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 08:30:55,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-08 08:30:55,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4726277372262773) internal successors, (807), 548 states have internal predecessors, (807), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 813 transitions. [2025-03-08 08:30:55,237 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 813 transitions. Word has length 158 [2025-03-08 08:30:55,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:55,238 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 813 transitions. [2025-03-08 08:30:55,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:55,238 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 813 transitions. [2025-03-08 08:30:55,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 08:30:55,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:55,239 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:55,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 08:30:55,240 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:55,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:55,241 INFO L85 PathProgramCache]: Analyzing trace with hash -625087727, now seen corresponding path program 1 times [2025-03-08 08:30:55,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:55,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545658171] [2025-03-08 08:30:55,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:55,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:55,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 08:30:55,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 08:30:55,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:55,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:55,509 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:30:55,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:55,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545658171] [2025-03-08 08:30:55,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545658171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:55,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:30:55,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:30:55,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245534652] [2025-03-08 08:30:55,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:55,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:30:55,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:55,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:30:55,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:30:55,511 INFO L87 Difference]: Start difference. First operand 553 states and 813 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:55,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:55,793 INFO L93 Difference]: Finished difference Result 1004 states and 1474 transitions. [2025-03-08 08:30:55,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:30:55,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 159 [2025-03-08 08:30:55,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:55,796 INFO L225 Difference]: With dead ends: 1004 [2025-03-08 08:30:55,796 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 08:30:55,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:30:55,797 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 1449 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1452 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:55,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1452 Valid, 1236 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:30:55,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 08:30:55,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-08 08:30:55,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4708029197080292) internal successors, (806), 548 states have internal predecessors, (806), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 812 transitions. [2025-03-08 08:30:55,806 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 812 transitions. Word has length 159 [2025-03-08 08:30:55,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:55,806 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 812 transitions. [2025-03-08 08:30:55,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 812 transitions. [2025-03-08 08:30:55,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 08:30:55,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:55,808 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:55,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 08:30:55,808 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:55,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:55,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1309586036, now seen corresponding path program 1 times [2025-03-08 08:30:55,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:55,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87305269] [2025-03-08 08:30:55,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:55,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:55,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 08:30:55,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 08:30:55,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:55,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:30:56,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:56,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87305269] [2025-03-08 08:30:56,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87305269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:56,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:30:56,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:30:56,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961916398] [2025-03-08 08:30:56,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:56,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:30:56,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:56,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:30:56,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:30:56,110 INFO L87 Difference]: Start difference. First operand 553 states and 812 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:56,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:56,358 INFO L93 Difference]: Finished difference Result 1004 states and 1472 transitions. [2025-03-08 08:30:56,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:30:56,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 160 [2025-03-08 08:30:56,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:56,360 INFO L225 Difference]: With dead ends: 1004 [2025-03-08 08:30:56,360 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 08:30:56,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:30:56,361 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 694 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:56,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1284 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:30:56,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 08:30:56,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-08 08:30:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.468978102189781) internal successors, (805), 548 states have internal predecessors, (805), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 811 transitions. [2025-03-08 08:30:56,373 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 811 transitions. Word has length 160 [2025-03-08 08:30:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:56,373 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 811 transitions. [2025-03-08 08:30:56,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 811 transitions. [2025-03-08 08:30:56,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 08:30:56,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:56,375 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:56,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 08:30:56,375 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:56,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:56,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1171256049, now seen corresponding path program 1 times [2025-03-08 08:30:56,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:56,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268499712] [2025-03-08 08:30:56,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:56,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:56,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 08:30:56,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 08:30:56,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:56,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:30:56,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:56,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268499712] [2025-03-08 08:30:56,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268499712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:56,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:30:56,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:30:56,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700201544] [2025-03-08 08:30:56,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:56,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:30:56,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:56,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:30:56,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:30:56,607 INFO L87 Difference]: Start difference. First operand 553 states and 811 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:56,876 INFO L93 Difference]: Finished difference Result 1010 states and 1478 transitions. [2025-03-08 08:30:56,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:30:56,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 161 [2025-03-08 08:30:56,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:56,878 INFO L225 Difference]: With dead ends: 1010 [2025-03-08 08:30:56,878 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 08:30:56,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:30:56,879 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 705 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:56,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1977 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:30:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 08:30:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-08 08:30:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.467153284671533) internal successors, (804), 548 states have internal predecessors, (804), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 810 transitions. [2025-03-08 08:30:56,892 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 810 transitions. Word has length 161 [2025-03-08 08:30:56,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:56,893 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 810 transitions. [2025-03-08 08:30:56,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 810 transitions. [2025-03-08 08:30:56,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 08:30:56,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:56,895 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:56,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 08:30:56,895 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:56,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:56,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1069183587, now seen corresponding path program 1 times [2025-03-08 08:30:56,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:56,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430410049] [2025-03-08 08:30:56,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:56,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:56,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 08:30:56,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 08:30:56,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:56,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:30:57,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:57,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430410049] [2025-03-08 08:30:57,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430410049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:57,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:30:57,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:30:57,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59082082] [2025-03-08 08:30:57,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:57,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:30:57,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:57,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:30:57,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:30:57,122 INFO L87 Difference]: Start difference. First operand 553 states and 810 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:57,366 INFO L93 Difference]: Finished difference Result 1004 states and 1468 transitions. [2025-03-08 08:30:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:30:57,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 162 [2025-03-08 08:30:57,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:57,369 INFO L225 Difference]: With dead ends: 1004 [2025-03-08 08:30:57,369 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 08:30:57,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:30:57,371 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 794 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:57,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1291 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:30:57,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 08:30:57,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-08 08:30:57,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4653284671532847) internal successors, (803), 548 states have internal predecessors, (803), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 809 transitions. [2025-03-08 08:30:57,383 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 809 transitions. Word has length 162 [2025-03-08 08:30:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:57,383 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 809 transitions. [2025-03-08 08:30:57,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 809 transitions. [2025-03-08 08:30:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 08:30:57,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:57,385 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:57,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 08:30:57,386 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:57,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:57,386 INFO L85 PathProgramCache]: Analyzing trace with hash -499055434, now seen corresponding path program 1 times [2025-03-08 08:30:57,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:57,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562593021] [2025-03-08 08:30:57,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:57,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:57,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 08:30:57,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 08:30:57,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:57,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:30:57,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:57,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562593021] [2025-03-08 08:30:57,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562593021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:57,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:30:57,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:30:57,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807653995] [2025-03-08 08:30:57,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:57,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:30:57,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:57,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:30:57,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:30:57,643 INFO L87 Difference]: Start difference. First operand 553 states and 809 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:57,879 INFO L93 Difference]: Finished difference Result 1004 states and 1466 transitions. [2025-03-08 08:30:57,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:30:57,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 163 [2025-03-08 08:30:57,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:57,882 INFO L225 Difference]: With dead ends: 1004 [2025-03-08 08:30:57,884 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 08:30:57,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:30:57,885 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 790 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:57,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 1291 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:30:57,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 08:30:57,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-08 08:30:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4635036496350364) internal successors, (802), 548 states have internal predecessors, (802), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:57,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 808 transitions. [2025-03-08 08:30:57,895 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 808 transitions. Word has length 163 [2025-03-08 08:30:57,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:57,896 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 808 transitions. [2025-03-08 08:30:57,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:57,896 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 808 transitions. [2025-03-08 08:30:57,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 08:30:57,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:57,897 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:57,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 08:30:57,897 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:57,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:57,898 INFO L85 PathProgramCache]: Analyzing trace with hash -338789822, now seen corresponding path program 1 times [2025-03-08 08:30:57,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:57,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441135594] [2025-03-08 08:30:57,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:57,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:57,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 08:30:57,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 08:30:57,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:57,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:58,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:30:58,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:58,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441135594] [2025-03-08 08:30:58,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441135594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:58,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:30:58,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:30:58,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112495227] [2025-03-08 08:30:58,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:58,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:30:58,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:58,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:30:58,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:30:58,182 INFO L87 Difference]: Start difference. First operand 553 states and 808 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:58,389 INFO L93 Difference]: Finished difference Result 1003 states and 1463 transitions. [2025-03-08 08:30:58,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:30:58,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 164 [2025-03-08 08:30:58,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:58,391 INFO L225 Difference]: With dead ends: 1003 [2025-03-08 08:30:58,391 INFO L226 Difference]: Without dead ends: 552 [2025-03-08 08:30:58,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:30:58,393 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 695 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:58,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 1308 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:30:58,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-08 08:30:58,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-08 08:30:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4606946983546618) internal successors, (799), 547 states have internal predecessors, (799), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:58,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 805 transitions. [2025-03-08 08:30:58,404 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 805 transitions. Word has length 164 [2025-03-08 08:30:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:58,405 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 805 transitions. [2025-03-08 08:30:58,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 805 transitions. [2025-03-08 08:30:58,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 08:30:58,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:58,407 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:58,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 08:30:58,407 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:58,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:58,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1571641029, now seen corresponding path program 1 times [2025-03-08 08:30:58,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:58,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416705850] [2025-03-08 08:30:58,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:58,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:58,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 08:30:58,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 08:30:58,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:58,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:58,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:30:58,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:58,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416705850] [2025-03-08 08:30:58,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416705850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:58,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:30:58,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:30:58,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795640005] [2025-03-08 08:30:58,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:58,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:30:58,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:58,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:30:58,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:30:58,621 INFO L87 Difference]: Start difference. First operand 552 states and 805 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:58,857 INFO L93 Difference]: Finished difference Result 1004 states and 1460 transitions. [2025-03-08 08:30:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:30:58,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 165 [2025-03-08 08:30:58,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:58,860 INFO L225 Difference]: With dead ends: 1004 [2025-03-08 08:30:58,860 INFO L226 Difference]: Without dead ends: 552 [2025-03-08 08:30:58,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:30:58,861 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 699 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:58,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1983 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:30:58,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-08 08:30:58,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-08 08:30:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4588665447897624) internal successors, (798), 547 states have internal predecessors, (798), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:58,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 804 transitions. [2025-03-08 08:30:58,870 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 804 transitions. Word has length 165 [2025-03-08 08:30:58,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:58,870 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 804 transitions. [2025-03-08 08:30:58,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:30:58,870 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 804 transitions. [2025-03-08 08:30:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 08:30:58,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:58,871 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:58,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 08:30:58,872 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:58,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:58,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1134604829, now seen corresponding path program 1 times [2025-03-08 08:30:58,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:58,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626387880] [2025-03-08 08:30:58,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:58,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:58,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 08:30:58,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 08:30:58,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:58,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:30:59,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:59,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626387880] [2025-03-08 08:30:59,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626387880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:59,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:30:59,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:30:59,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805140973] [2025-03-08 08:30:59,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:59,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:30:59,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:59,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:30:59,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:30:59,178 INFO L87 Difference]: Start difference. First operand 552 states and 804 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 08:30:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:59,413 INFO L93 Difference]: Finished difference Result 1002 states and 1456 transitions. [2025-03-08 08:30:59,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:30:59,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 166 [2025-03-08 08:30:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:59,416 INFO L225 Difference]: With dead ends: 1002 [2025-03-08 08:30:59,417 INFO L226 Difference]: Without dead ends: 552 [2025-03-08 08:30:59,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:30:59,418 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 733 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:59,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 1312 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:30:59,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-08 08:30:59,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-08 08:30:59,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4570383912248628) internal successors, (797), 547 states have internal predecessors, (797), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:59,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 803 transitions. [2025-03-08 08:30:59,429 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 803 transitions. Word has length 166 [2025-03-08 08:30:59,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:59,429 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 803 transitions. [2025-03-08 08:30:59,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 08:30:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 803 transitions. [2025-03-08 08:30:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 08:30:59,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:59,431 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:59,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 08:30:59,431 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:59,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:59,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1191887766, now seen corresponding path program 1 times [2025-03-08 08:30:59,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:59,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555579593] [2025-03-08 08:30:59,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:59,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:30:59,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 08:30:59,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 08:30:59,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:30:59,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:30:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:30:59,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:30:59,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555579593] [2025-03-08 08:30:59,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555579593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:30:59,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:30:59,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:30:59,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760637968] [2025-03-08 08:30:59,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:30:59,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:30:59,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:30:59,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:30:59,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:30:59,734 INFO L87 Difference]: Start difference. First operand 552 states and 803 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 08:30:59,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:30:59,960 INFO L93 Difference]: Finished difference Result 1002 states and 1454 transitions. [2025-03-08 08:30:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:30:59,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 167 [2025-03-08 08:30:59,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:30:59,963 INFO L225 Difference]: With dead ends: 1002 [2025-03-08 08:30:59,963 INFO L226 Difference]: Without dead ends: 552 [2025-03-08 08:30:59,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:30:59,964 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 731 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:30:59,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1312 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:30:59,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-08 08:30:59,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-08 08:30:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4552102376599634) internal successors, (796), 547 states have internal predecessors, (796), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:30:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 802 transitions. [2025-03-08 08:30:59,992 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 802 transitions. Word has length 167 [2025-03-08 08:30:59,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:30:59,992 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 802 transitions. [2025-03-08 08:30:59,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 08:30:59,993 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 802 transitions. [2025-03-08 08:30:59,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 08:30:59,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:30:59,994 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:30:59,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 08:30:59,994 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:30:59,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:30:59,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2071413179, now seen corresponding path program 1 times [2025-03-08 08:30:59,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:30:59,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656786168] [2025-03-08 08:30:59,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:30:59,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:00,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 08:31:00,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 08:31:00,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:00,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:31:00,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:00,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656786168] [2025-03-08 08:31:00,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656786168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:00,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:00,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:00,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561609000] [2025-03-08 08:31:00,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:00,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:00,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:00,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:00,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:00,413 INFO L87 Difference]: Start difference. First operand 552 states and 802 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:00,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:00,718 INFO L93 Difference]: Finished difference Result 1002 states and 1452 transitions. [2025-03-08 08:31:00,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:00,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 168 [2025-03-08 08:31:00,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:00,720 INFO L225 Difference]: With dead ends: 1002 [2025-03-08 08:31:00,720 INFO L226 Difference]: Without dead ends: 552 [2025-03-08 08:31:00,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:00,721 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 675 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:00,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1218 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:31:00,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-08 08:31:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-08 08:31:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.453382084095064) internal successors, (795), 547 states have internal predecessors, (795), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:31:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 801 transitions. [2025-03-08 08:31:00,733 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 801 transitions. Word has length 168 [2025-03-08 08:31:00,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:00,733 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 801 transitions. [2025-03-08 08:31:00,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 801 transitions. [2025-03-08 08:31:00,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 08:31:00,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:00,736 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:31:00,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 08:31:00,736 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:00,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:00,736 INFO L85 PathProgramCache]: Analyzing trace with hash 193643186, now seen corresponding path program 1 times [2025-03-08 08:31:00,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:00,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116528168] [2025-03-08 08:31:00,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:00,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:00,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 08:31:00,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 08:31:00,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:00,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:01,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:31:01,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:01,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116528168] [2025-03-08 08:31:01,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116528168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:01,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:01,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:01,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876908608] [2025-03-08 08:31:01,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:01,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:01,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:01,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:01,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:01,092 INFO L87 Difference]: Start difference. First operand 552 states and 801 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:01,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:01,407 INFO L93 Difference]: Finished difference Result 1002 states and 1450 transitions. [2025-03-08 08:31:01,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:01,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 169 [2025-03-08 08:31:01,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:01,411 INFO L225 Difference]: With dead ends: 1002 [2025-03-08 08:31:01,411 INFO L226 Difference]: Without dead ends: 552 [2025-03-08 08:31:01,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:01,412 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 1338 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1338 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:01,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1338 Valid, 1218 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:31:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-08 08:31:01,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-08 08:31:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4515539305301646) internal successors, (794), 547 states have internal predecessors, (794), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:31:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 800 transitions. [2025-03-08 08:31:01,423 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 800 transitions. Word has length 169 [2025-03-08 08:31:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:01,423 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 800 transitions. [2025-03-08 08:31:01,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 800 transitions. [2025-03-08 08:31:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 08:31:01,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:01,424 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:31:01,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 08:31:01,425 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:01,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:01,425 INFO L85 PathProgramCache]: Analyzing trace with hash -292410283, now seen corresponding path program 1 times [2025-03-08 08:31:01,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:01,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20815640] [2025-03-08 08:31:01,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:01,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:01,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 08:31:01,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 08:31:01,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:01,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:31:01,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:01,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20815640] [2025-03-08 08:31:01,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20815640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:01,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:01,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:01,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400478424] [2025-03-08 08:31:01,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:01,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:01,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:01,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:01,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:01,782 INFO L87 Difference]: Start difference. First operand 552 states and 800 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:02,103 INFO L93 Difference]: Finished difference Result 1002 states and 1448 transitions. [2025-03-08 08:31:02,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:02,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 170 [2025-03-08 08:31:02,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:02,105 INFO L225 Difference]: With dead ends: 1002 [2025-03-08 08:31:02,105 INFO L226 Difference]: Without dead ends: 552 [2025-03-08 08:31:02,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:02,107 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 1332 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:02,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1332 Valid, 1218 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:31:02,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-08 08:31:02,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-08 08:31:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4497257769652652) internal successors, (793), 547 states have internal predecessors, (793), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:31:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 799 transitions. [2025-03-08 08:31:02,117 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 799 transitions. Word has length 170 [2025-03-08 08:31:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:02,117 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 799 transitions. [2025-03-08 08:31:02,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 799 transitions. [2025-03-08 08:31:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 08:31:02,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:02,120 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:31:02,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 08:31:02,120 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:02,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:02,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1750622923, now seen corresponding path program 1 times [2025-03-08 08:31:02,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:02,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060628999] [2025-03-08 08:31:02,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:02,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:02,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 08:31:02,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 08:31:02,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:02,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:31:02,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:02,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060628999] [2025-03-08 08:31:02,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060628999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:02,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:02,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:02,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944115777] [2025-03-08 08:31:02,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:02,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:02,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:02,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:02,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:02,568 INFO L87 Difference]: Start difference. First operand 552 states and 799 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:02,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:02,946 INFO L93 Difference]: Finished difference Result 1008 states and 1454 transitions. [2025-03-08 08:31:02,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:31:02,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 171 [2025-03-08 08:31:02,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:02,949 INFO L225 Difference]: With dead ends: 1008 [2025-03-08 08:31:02,949 INFO L226 Difference]: Without dead ends: 556 [2025-03-08 08:31:02,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:02,950 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 2 mSDsluCounter, 1819 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:02,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2477 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 08:31:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-08 08:31:02,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 554. [2025-03-08 08:31:02,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 549 states have (on average 1.4480874316939891) internal successors, (795), 549 states have internal predecessors, (795), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:31:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 801 transitions. [2025-03-08 08:31:02,960 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 801 transitions. Word has length 171 [2025-03-08 08:31:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:02,961 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 801 transitions. [2025-03-08 08:31:02,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 801 transitions. [2025-03-08 08:31:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-08 08:31:02,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:02,962 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:31:02,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 08:31:02,962 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:02,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:02,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2111973140, now seen corresponding path program 1 times [2025-03-08 08:31:02,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:02,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710153157] [2025-03-08 08:31:02,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:02,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:02,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 08:31:03,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 08:31:03,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:03,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:31:03,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:03,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710153157] [2025-03-08 08:31:03,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710153157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:03,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:03,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:03,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184727712] [2025-03-08 08:31:03,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:03,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:03,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:03,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:03,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:03,350 INFO L87 Difference]: Start difference. First operand 554 states and 801 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:03,667 INFO L93 Difference]: Finished difference Result 1006 states and 1450 transitions. [2025-03-08 08:31:03,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:03,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 172 [2025-03-08 08:31:03,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:03,669 INFO L225 Difference]: With dead ends: 1006 [2025-03-08 08:31:03,669 INFO L226 Difference]: Without dead ends: 554 [2025-03-08 08:31:03,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:03,670 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 1324 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1324 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:03,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1324 Valid, 1218 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:31:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-08 08:31:03,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-03-08 08:31:03,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 549 states have (on average 1.4462659380692167) internal successors, (794), 549 states have internal predecessors, (794), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:31:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 800 transitions. [2025-03-08 08:31:03,682 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 800 transitions. Word has length 172 [2025-03-08 08:31:03,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:03,683 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 800 transitions. [2025-03-08 08:31:03,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 800 transitions. [2025-03-08 08:31:03,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-08 08:31:03,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:03,684 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:31:03,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 08:31:03,684 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:03,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:03,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1744479520, now seen corresponding path program 1 times [2025-03-08 08:31:03,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:03,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423865850] [2025-03-08 08:31:03,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:03,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:03,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 08:31:03,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 08:31:03,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:03,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:03,977 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:31:03,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:03,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423865850] [2025-03-08 08:31:03,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423865850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:03,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:03,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:31:03,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528618601] [2025-03-08 08:31:03,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:03,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:31:03,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:03,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:31:03,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:31:03,979 INFO L87 Difference]: Start difference. First operand 554 states and 800 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:04,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:04,340 INFO L93 Difference]: Finished difference Result 1008 states and 1450 transitions. [2025-03-08 08:31:04,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:04,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 173 [2025-03-08 08:31:04,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:04,342 INFO L225 Difference]: With dead ends: 1008 [2025-03-08 08:31:04,342 INFO L226 Difference]: Without dead ends: 554 [2025-03-08 08:31:04,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:31:04,343 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 2 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:04,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1821 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:31:04,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-08 08:31:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2025-03-08 08:31:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4460694698354661) internal successors, (791), 547 states have internal predecessors, (791), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:31:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 797 transitions. [2025-03-08 08:31:04,354 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 797 transitions. Word has length 173 [2025-03-08 08:31:04,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:04,354 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 797 transitions. [2025-03-08 08:31:04,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:04,355 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 797 transitions. [2025-03-08 08:31:04,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-08 08:31:04,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:04,356 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:31:04,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 08:31:04,356 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:04,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:04,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1590117029, now seen corresponding path program 1 times [2025-03-08 08:31:04,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:04,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472076646] [2025-03-08 08:31:04,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:04,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:04,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 08:31:04,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 08:31:04,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:04,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:31:04,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:04,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472076646] [2025-03-08 08:31:04,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472076646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:04,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:04,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:31:04,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474542659] [2025-03-08 08:31:04,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:04,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:31:04,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:04,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:31:04,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:31:04,663 INFO L87 Difference]: Start difference. First operand 552 states and 797 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:04,906 INFO L93 Difference]: Finished difference Result 1002 states and 1442 transitions. [2025-03-08 08:31:04,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:04,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 173 [2025-03-08 08:31:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:04,908 INFO L225 Difference]: With dead ends: 1002 [2025-03-08 08:31:04,908 INFO L226 Difference]: Without dead ends: 552 [2025-03-08 08:31:04,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:04,909 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 651 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:04,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1216 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:04,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-08 08:31:04,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-08 08:31:04,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4442413162705667) internal successors, (790), 547 states have internal predecessors, (790), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:31:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 796 transitions. [2025-03-08 08:31:04,919 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 796 transitions. Word has length 173 [2025-03-08 08:31:04,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:04,919 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 796 transitions. [2025-03-08 08:31:04,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:04,920 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 796 transitions. [2025-03-08 08:31:04,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-08 08:31:04,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:04,920 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:31:04,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 08:31:04,921 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:04,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:04,921 INFO L85 PathProgramCache]: Analyzing trace with hash -756111866, now seen corresponding path program 1 times [2025-03-08 08:31:04,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:04,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216089208] [2025-03-08 08:31:04,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:04,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:04,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 08:31:04,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 08:31:04,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:04,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:31:05,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:05,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216089208] [2025-03-08 08:31:05,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216089208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:05,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:05,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:05,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937317005] [2025-03-08 08:31:05,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:05,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:05,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:05,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:05,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:05,223 INFO L87 Difference]: Start difference. First operand 552 states and 796 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:05,510 INFO L93 Difference]: Finished difference Result 1002 states and 1440 transitions. [2025-03-08 08:31:05,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:05,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 174 [2025-03-08 08:31:05,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:05,512 INFO L225 Difference]: With dead ends: 1002 [2025-03-08 08:31:05,512 INFO L226 Difference]: Without dead ends: 552 [2025-03-08 08:31:05,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:05,513 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 1310 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:05,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1310 Valid, 1216 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:31:05,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-08 08:31:05,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-08 08:31:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4424131627056673) internal successors, (789), 547 states have internal predecessors, (789), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:31:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 795 transitions. [2025-03-08 08:31:05,524 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 795 transitions. Word has length 174 [2025-03-08 08:31:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:05,525 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 795 transitions. [2025-03-08 08:31:05,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 795 transitions. [2025-03-08 08:31:05,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 08:31:05,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:05,526 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:31:05,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 08:31:05,526 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:05,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:05,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1257269507, now seen corresponding path program 1 times [2025-03-08 08:31:05,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:05,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737915906] [2025-03-08 08:31:05,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:05,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:05,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 08:31:05,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 08:31:05,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:05,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:31:05,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:05,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737915906] [2025-03-08 08:31:05,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737915906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:05,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:05,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:05,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334107640] [2025-03-08 08:31:05,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:05,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:05,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:05,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:05,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:05,834 INFO L87 Difference]: Start difference. First operand 552 states and 795 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:06,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:06,112 INFO L93 Difference]: Finished difference Result 1002 states and 1438 transitions. [2025-03-08 08:31:06,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:06,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 175 [2025-03-08 08:31:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:06,114 INFO L225 Difference]: With dead ends: 1002 [2025-03-08 08:31:06,114 INFO L226 Difference]: Without dead ends: 552 [2025-03-08 08:31:06,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:06,115 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 1304 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:06,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 1216 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-08 08:31:06,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-08 08:31:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.440585009140768) internal successors, (788), 547 states have internal predecessors, (788), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:31:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 794 transitions. [2025-03-08 08:31:06,123 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 794 transitions. Word has length 175 [2025-03-08 08:31:06,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:06,123 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 794 transitions. [2025-03-08 08:31:06,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:06,124 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 794 transitions. [2025-03-08 08:31:06,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 08:31:06,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:06,124 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:31:06,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 08:31:06,125 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:06,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:06,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1697804925, now seen corresponding path program 1 times [2025-03-08 08:31:06,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:06,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262629312] [2025-03-08 08:31:06,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:06,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:06,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 08:31:06,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 08:31:06,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:06,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:31:06,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:06,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262629312] [2025-03-08 08:31:06,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262629312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:06,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:06,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:31:06,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399954480] [2025-03-08 08:31:06,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:06,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:31:06,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:06,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:31:06,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:31:06,382 INFO L87 Difference]: Start difference. First operand 552 states and 794 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:06,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:06,568 INFO L93 Difference]: Finished difference Result 1002 states and 1436 transitions. [2025-03-08 08:31:06,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:06,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 176 [2025-03-08 08:31:06,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:06,570 INFO L225 Difference]: With dead ends: 1002 [2025-03-08 08:31:06,571 INFO L226 Difference]: Without dead ends: 552 [2025-03-08 08:31:06,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:06,572 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 682 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:06,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1288 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:06,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-08 08:31:06,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-08 08:31:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4387568555758683) internal successors, (787), 547 states have internal predecessors, (787), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:31:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 793 transitions. [2025-03-08 08:31:06,582 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 793 transitions. Word has length 176 [2025-03-08 08:31:06,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:06,583 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 793 transitions. [2025-03-08 08:31:06,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:06,583 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 793 transitions. [2025-03-08 08:31:06,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 08:31:06,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:06,584 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:31:06,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 08:31:06,584 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:06,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:06,584 INFO L85 PathProgramCache]: Analyzing trace with hash -15263543, now seen corresponding path program 1 times [2025-03-08 08:31:06,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:06,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378343276] [2025-03-08 08:31:06,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:06,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:06,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 08:31:06,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 08:31:06,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:06,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:31:07,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:07,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378343276] [2025-03-08 08:31:07,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378343276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:07,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:07,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:07,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686648035] [2025-03-08 08:31:07,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:07,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:07,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:07,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:07,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:07,083 INFO L87 Difference]: Start difference. First operand 552 states and 793 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:07,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:07,539 INFO L93 Difference]: Finished difference Result 1006 states and 1439 transitions. [2025-03-08 08:31:07,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:31:07,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 177 [2025-03-08 08:31:07,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:07,541 INFO L225 Difference]: With dead ends: 1006 [2025-03-08 08:31:07,541 INFO L226 Difference]: Without dead ends: 556 [2025-03-08 08:31:07,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:07,542 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 689 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:07,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1505 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 08:31:07,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-08 08:31:07,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 555. [2025-03-08 08:31:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.4363636363636363) internal successors, (790), 550 states have internal predecessors, (790), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:31:07,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 796 transitions. [2025-03-08 08:31:07,550 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 796 transitions. Word has length 177 [2025-03-08 08:31:07,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:07,550 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 796 transitions. [2025-03-08 08:31:07,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:07,551 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 796 transitions. [2025-03-08 08:31:07,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 08:31:07,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:07,552 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:31:07,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 08:31:07,552 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:07,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:07,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1723240640, now seen corresponding path program 1 times [2025-03-08 08:31:07,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:07,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072990545] [2025-03-08 08:31:07,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:07,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:07,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 08:31:07,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 08:31:07,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:07,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:31:07,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:07,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072990545] [2025-03-08 08:31:07,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072990545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:07,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:07,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:07,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049775327] [2025-03-08 08:31:07,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:07,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:07,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:07,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:07,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:07,898 INFO L87 Difference]: Start difference. First operand 555 states and 796 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:08,158 INFO L93 Difference]: Finished difference Result 1008 states and 1440 transitions. [2025-03-08 08:31:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:08,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 178 [2025-03-08 08:31:08,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:08,160 INFO L225 Difference]: With dead ends: 1008 [2025-03-08 08:31:08,160 INFO L226 Difference]: Without dead ends: 555 [2025-03-08 08:31:08,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:08,161 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 675 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:08,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1256 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-08 08:31:08,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2025-03-08 08:31:08,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.4345454545454546) internal successors, (789), 550 states have internal predecessors, (789), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:31:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 795 transitions. [2025-03-08 08:31:08,176 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 795 transitions. Word has length 178 [2025-03-08 08:31:08,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:08,176 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 795 transitions. [2025-03-08 08:31:08,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:08,177 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 795 transitions. [2025-03-08 08:31:08,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 08:31:08,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:08,178 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:31:08,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 08:31:08,178 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:08,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:08,178 INFO L85 PathProgramCache]: Analyzing trace with hash 180542261, now seen corresponding path program 1 times [2025-03-08 08:31:08,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:08,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11355721] [2025-03-08 08:31:08,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:08,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:08,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 08:31:08,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 08:31:08,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:08,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:31:08,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:08,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11355721] [2025-03-08 08:31:08,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11355721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:08,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:08,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:31:08,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29092934] [2025-03-08 08:31:08,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:08,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:31:08,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:08,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:31:08,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:31:08,429 INFO L87 Difference]: Start difference. First operand 555 states and 795 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:08,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:08,690 INFO L93 Difference]: Finished difference Result 1008 states and 1438 transitions. [2025-03-08 08:31:08,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:08,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 179 [2025-03-08 08:31:08,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:08,692 INFO L225 Difference]: With dead ends: 1008 [2025-03-08 08:31:08,692 INFO L226 Difference]: Without dead ends: 555 [2025-03-08 08:31:08,693 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-03-08 08:31:08,693 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 668 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:08,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1256 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-08 08:31:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2025-03-08 08:31:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.4327272727272726) internal successors, (788), 550 states have internal predecessors, (788), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:31:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 794 transitions. [2025-03-08 08:31:08,701 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 794 transitions. Word has length 179 [2025-03-08 08:31:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:08,702 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 794 transitions. [2025-03-08 08:31:08,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:08,702 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 794 transitions. [2025-03-08 08:31:08,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 08:31:08,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:08,703 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:31:08,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 08:31:08,703 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:08,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:08,704 INFO L85 PathProgramCache]: Analyzing trace with hash 908596472, now seen corresponding path program 1 times [2025-03-08 08:31:08,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:08,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177843273] [2025-03-08 08:31:08,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:08,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:08,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 08:31:08,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 08:31:08,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:08,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:09,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:31:09,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:09,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177843273] [2025-03-08 08:31:09,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177843273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:09,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:09,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 08:31:09,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930291089] [2025-03-08 08:31:09,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:09,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 08:31:09,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:09,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 08:31:09,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:31:09,238 INFO L87 Difference]: Start difference. First operand 555 states and 794 transitions. Second operand has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:10,591 INFO L93 Difference]: Finished difference Result 1585 states and 2213 transitions. [2025-03-08 08:31:10,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 08:31:10,591 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 180 [2025-03-08 08:31:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:10,594 INFO L225 Difference]: With dead ends: 1585 [2025-03-08 08:31:10,594 INFO L226 Difference]: Without dead ends: 1132 [2025-03-08 08:31:10,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-08 08:31:10,595 INFO L435 NwaCegarLoop]: 1004 mSDtfsCounter, 1500 mSDsluCounter, 4335 mSDsCounter, 0 mSdLazyCounter, 2613 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 5339 SdHoareTripleChecker+Invalid, 2615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:10,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 5339 Invalid, 2615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2613 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 08:31:10,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2025-03-08 08:31:10,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1002. [2025-03-08 08:31:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 994 states have (on average 1.4275653923541247) internal successors, (1419), 994 states have internal predecessors, (1419), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 08:31:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1431 transitions. [2025-03-08 08:31:10,618 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1431 transitions. Word has length 180 [2025-03-08 08:31:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:10,619 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1431 transitions. [2025-03-08 08:31:10,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1431 transitions. [2025-03-08 08:31:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 08:31:10,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:10,620 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:31:10,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 08:31:10,620 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:10,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:10,620 INFO L85 PathProgramCache]: Analyzing trace with hash 610168039, now seen corresponding path program 1 times [2025-03-08 08:31:10,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:10,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310056192] [2025-03-08 08:31:10,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:10,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:10,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 08:31:10,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 08:31:10,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:10,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:31:10,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:10,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310056192] [2025-03-08 08:31:10,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310056192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:10,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:10,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:10,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963272723] [2025-03-08 08:31:10,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:10,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:10,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:10,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:10,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:10,931 INFO L87 Difference]: Start difference. First operand 1002 states and 1431 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:11,172 INFO L93 Difference]: Finished difference Result 1902 states and 2710 transitions. [2025-03-08 08:31:11,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:11,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 180 [2025-03-08 08:31:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:11,175 INFO L225 Difference]: With dead ends: 1902 [2025-03-08 08:31:11,175 INFO L226 Difference]: Without dead ends: 1002 [2025-03-08 08:31:11,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:11,176 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 670 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:11,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1263 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:11,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2025-03-08 08:31:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2025-03-08 08:31:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 994 states have (on average 1.4255533199195172) internal successors, (1417), 994 states have internal predecessors, (1417), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 08:31:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1429 transitions. [2025-03-08 08:31:11,191 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1429 transitions. Word has length 180 [2025-03-08 08:31:11,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:11,191 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1429 transitions. [2025-03-08 08:31:11,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:11,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1429 transitions. [2025-03-08 08:31:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 08:31:11,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:11,193 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:31:11,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 08:31:11,193 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:11,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:11,193 INFO L85 PathProgramCache]: Analyzing trace with hash -292699277, now seen corresponding path program 1 times [2025-03-08 08:31:11,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:11,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061054322] [2025-03-08 08:31:11,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:11,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:11,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 08:31:11,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 08:31:11,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:11,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:11,879 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:31:11,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:11,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061054322] [2025-03-08 08:31:11,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061054322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:11,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:11,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 08:31:11,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574438388] [2025-03-08 08:31:11,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:11,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 08:31:11,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:11,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 08:31:11,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:31:11,880 INFO L87 Difference]: Start difference. First operand 1002 states and 1429 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:12,314 INFO L93 Difference]: Finished difference Result 2125 states and 2982 transitions. [2025-03-08 08:31:12,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 08:31:12,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 181 [2025-03-08 08:31:12,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:12,317 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:12,317 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:12,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 08:31:12,318 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 1126 mSDsluCounter, 2558 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 3200 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:12,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 3200 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 08:31:12,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:12,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.387973640856672) internal successors, (1685), 1214 states have internal predecessors, (1685), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1703 transitions. [2025-03-08 08:31:12,338 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1703 transitions. Word has length 181 [2025-03-08 08:31:12,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:12,338 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1703 transitions. [2025-03-08 08:31:12,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:31:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1703 transitions. [2025-03-08 08:31:12,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-08 08:31:12,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:12,341 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 08:31:12,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 08:31:12,341 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:12,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:12,342 INFO L85 PathProgramCache]: Analyzing trace with hash 735465771, now seen corresponding path program 1 times [2025-03-08 08:31:12,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:12,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150028196] [2025-03-08 08:31:12,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:12,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:12,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-08 08:31:12,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-08 08:31:12,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:12,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:12,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:12,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150028196] [2025-03-08 08:31:12,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150028196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:12,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:12,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:12,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241550430] [2025-03-08 08:31:12,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:12,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:12,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:12,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:12,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:12,935 INFO L87 Difference]: Start difference. First operand 1225 states and 1703 transitions. Second operand has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:13,196 INFO L93 Difference]: Finished difference Result 2125 states and 2980 transitions. [2025-03-08 08:31:13,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:13,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 448 [2025-03-08 08:31:13,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:13,201 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:13,202 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:13,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:13,203 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 722 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:13,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1215 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:13,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:13,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:13,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.386326194398682) internal successors, (1683), 1214 states have internal predecessors, (1683), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1701 transitions. [2025-03-08 08:31:13,229 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1701 transitions. Word has length 448 [2025-03-08 08:31:13,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:13,230 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1701 transitions. [2025-03-08 08:31:13,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1701 transitions. [2025-03-08 08:31:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-03-08 08:31:13,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:13,234 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 08:31:13,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 08:31:13,234 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:13,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:13,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1240458003, now seen corresponding path program 1 times [2025-03-08 08:31:13,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:13,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440514622] [2025-03-08 08:31:13,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:13,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:13,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-08 08:31:13,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-08 08:31:13,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:13,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:13,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:13,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440514622] [2025-03-08 08:31:13,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440514622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:13,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:13,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:13,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977507513] [2025-03-08 08:31:13,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:13,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:13,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:13,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:13,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:13,956 INFO L87 Difference]: Start difference. First operand 1225 states and 1701 transitions. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:14,253 INFO L93 Difference]: Finished difference Result 2125 states and 2976 transitions. [2025-03-08 08:31:14,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:14,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 449 [2025-03-08 08:31:14,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:14,256 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:14,256 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:14,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:14,257 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 1305 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:14,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 1208 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:31:14,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:14,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:14,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.384678747940692) internal successors, (1681), 1214 states have internal predecessors, (1681), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1699 transitions. [2025-03-08 08:31:14,275 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1699 transitions. Word has length 449 [2025-03-08 08:31:14,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:14,275 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1699 transitions. [2025-03-08 08:31:14,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1699 transitions. [2025-03-08 08:31:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-03-08 08:31:14,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:14,278 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 08:31:14,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 08:31:14,279 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:14,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:14,279 INFO L85 PathProgramCache]: Analyzing trace with hash 656402490, now seen corresponding path program 1 times [2025-03-08 08:31:14,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:14,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306471119] [2025-03-08 08:31:14,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:14,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:14,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-03-08 08:31:14,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-03-08 08:31:14,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:14,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:14,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:14,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306471119] [2025-03-08 08:31:14,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306471119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:14,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:14,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:14,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176893044] [2025-03-08 08:31:14,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:14,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:14,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:14,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:14,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:14,879 INFO L87 Difference]: Start difference. First operand 1225 states and 1699 transitions. Second operand has 5 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:15,140 INFO L93 Difference]: Finished difference Result 2125 states and 2972 transitions. [2025-03-08 08:31:15,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:15,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 450 [2025-03-08 08:31:15,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:15,147 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:15,147 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:15,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:15,151 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 706 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:15,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1215 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:15,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:15,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.3830313014827018) internal successors, (1679), 1214 states have internal predecessors, (1679), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:15,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1697 transitions. [2025-03-08 08:31:15,173 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1697 transitions. Word has length 450 [2025-03-08 08:31:15,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:15,173 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1697 transitions. [2025-03-08 08:31:15,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:15,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1697 transitions. [2025-03-08 08:31:15,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-03-08 08:31:15,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:15,177 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 08:31:15,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 08:31:15,177 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:15,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:15,178 INFO L85 PathProgramCache]: Analyzing trace with hash -418337636, now seen corresponding path program 1 times [2025-03-08 08:31:15,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:15,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226734090] [2025-03-08 08:31:15,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:15,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:15,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-03-08 08:31:15,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-03-08 08:31:15,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:15,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:15,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:15,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226734090] [2025-03-08 08:31:15,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226734090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:15,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:15,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:15,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536537580] [2025-03-08 08:31:15,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:15,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:15,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:15,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:15,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:15,746 INFO L87 Difference]: Start difference. First operand 1225 states and 1697 transitions. Second operand has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:15,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:15,997 INFO L93 Difference]: Finished difference Result 2125 states and 2968 transitions. [2025-03-08 08:31:15,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:15,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 451 [2025-03-08 08:31:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:16,002 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:16,002 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:16,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:16,004 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 1273 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:16,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1208 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:16,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:16,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.3813838550247117) internal successors, (1677), 1214 states have internal predecessors, (1677), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1695 transitions. [2025-03-08 08:31:16,024 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1695 transitions. Word has length 451 [2025-03-08 08:31:16,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:16,024 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1695 transitions. [2025-03-08 08:31:16,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:16,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1695 transitions. [2025-03-08 08:31:16,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-03-08 08:31:16,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:16,028 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 08:31:16,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 08:31:16,028 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:16,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:16,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1176694327, now seen corresponding path program 1 times [2025-03-08 08:31:16,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:16,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45401573] [2025-03-08 08:31:16,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:16,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:16,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-08 08:31:16,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-08 08:31:16,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:16,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:16,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:16,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45401573] [2025-03-08 08:31:16,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45401573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:16,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:16,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:16,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255105251] [2025-03-08 08:31:16,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:16,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:16,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:16,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:16,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:16,759 INFO L87 Difference]: Start difference. First operand 1225 states and 1695 transitions. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:17,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:17,039 INFO L93 Difference]: Finished difference Result 2125 states and 2964 transitions. [2025-03-08 08:31:17,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:17,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 452 [2025-03-08 08:31:17,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:17,042 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:17,042 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:17,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:17,043 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 1257 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:17,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 1208 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:31:17,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:17,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.3797364085667216) internal successors, (1675), 1214 states have internal predecessors, (1675), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1693 transitions. [2025-03-08 08:31:17,060 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1693 transitions. Word has length 452 [2025-03-08 08:31:17,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:17,060 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2025-03-08 08:31:17,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:17,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1693 transitions. [2025-03-08 08:31:17,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-08 08:31:17,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:17,063 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 08:31:17,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 08:31:17,063 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:17,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:17,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1595528907, now seen corresponding path program 1 times [2025-03-08 08:31:17,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:17,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643296857] [2025-03-08 08:31:17,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:17,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:17,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-08 08:31:17,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-08 08:31:17,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:17,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:17,591 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:17,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:17,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643296857] [2025-03-08 08:31:17,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643296857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:17,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:17,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:17,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267184532] [2025-03-08 08:31:17,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:17,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:17,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:17,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:17,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:17,593 INFO L87 Difference]: Start difference. First operand 1225 states and 1693 transitions. Second operand has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:17,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:17,830 INFO L93 Difference]: Finished difference Result 2125 states and 2960 transitions. [2025-03-08 08:31:17,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:17,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 453 [2025-03-08 08:31:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:17,833 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:17,833 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:17,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:17,834 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 1241 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:17,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 1208 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:17,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:17,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.3780889621087316) internal successors, (1673), 1214 states have internal predecessors, (1673), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1691 transitions. [2025-03-08 08:31:17,855 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1691 transitions. Word has length 453 [2025-03-08 08:31:17,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:17,855 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1691 transitions. [2025-03-08 08:31:17,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1691 transitions. [2025-03-08 08:31:17,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-08 08:31:17,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:17,858 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 08:31:17,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 08:31:17,859 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:17,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:17,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1499951656, now seen corresponding path program 1 times [2025-03-08 08:31:17,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:17,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033625362] [2025-03-08 08:31:17,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:17,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:17,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-08 08:31:18,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-08 08:31:18,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:18,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:18,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:18,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033625362] [2025-03-08 08:31:18,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033625362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:18,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:18,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:18,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677392752] [2025-03-08 08:31:18,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:18,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:18,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:18,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:18,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:18,402 INFO L87 Difference]: Start difference. First operand 1225 states and 1691 transitions. Second operand has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:18,633 INFO L93 Difference]: Finished difference Result 2125 states and 2956 transitions. [2025-03-08 08:31:18,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:18,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 454 [2025-03-08 08:31:18,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:18,636 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:18,636 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:18,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:18,637 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 674 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:18,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 1215 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:18,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:18,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.3764415156507412) internal successors, (1671), 1214 states have internal predecessors, (1671), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1689 transitions. [2025-03-08 08:31:18,653 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1689 transitions. Word has length 454 [2025-03-08 08:31:18,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:18,654 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1689 transitions. [2025-03-08 08:31:18,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1689 transitions. [2025-03-08 08:31:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-08 08:31:18,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:18,657 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 08:31:18,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 08:31:18,657 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:18,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:18,658 INFO L85 PathProgramCache]: Analyzing trace with hash -283354246, now seen corresponding path program 1 times [2025-03-08 08:31:18,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:18,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556196192] [2025-03-08 08:31:18,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:18,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:18,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-08 08:31:18,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-08 08:31:18,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:18,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:19,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:19,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556196192] [2025-03-08 08:31:19,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556196192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:19,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:19,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:19,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744146939] [2025-03-08 08:31:19,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:19,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:19,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:19,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:19,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:19,238 INFO L87 Difference]: Start difference. First operand 1225 states and 1689 transitions. Second operand has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:19,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:19,451 INFO L93 Difference]: Finished difference Result 2125 states and 2952 transitions. [2025-03-08 08:31:19,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:19,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 455 [2025-03-08 08:31:19,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:19,454 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:19,454 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:19,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:19,455 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 666 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:19,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1215 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:19,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:19,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:19,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.3747940691927512) internal successors, (1669), 1214 states have internal predecessors, (1669), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1687 transitions. [2025-03-08 08:31:19,472 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1687 transitions. Word has length 455 [2025-03-08 08:31:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:19,472 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1687 transitions. [2025-03-08 08:31:19,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:19,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1687 transitions. [2025-03-08 08:31:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-08 08:31:19,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:19,475 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 08:31:19,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 08:31:19,475 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:19,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:19,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1120068505, now seen corresponding path program 1 times [2025-03-08 08:31:19,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:19,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329090867] [2025-03-08 08:31:19,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:19,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:19,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 08:31:19,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 08:31:19,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:19,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:20,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:20,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329090867] [2025-03-08 08:31:20,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329090867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:20,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:20,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:20,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599554782] [2025-03-08 08:31:20,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:20,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:20,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:20,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:20,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:20,071 INFO L87 Difference]: Start difference. First operand 1225 states and 1687 transitions. Second operand has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:20,280 INFO L93 Difference]: Finished difference Result 2125 states and 2948 transitions. [2025-03-08 08:31:20,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:20,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 456 [2025-03-08 08:31:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:20,284 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:20,284 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:20,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:20,286 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 1178 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:20,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1240 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:20,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:20,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.373146622734761) internal successors, (1667), 1214 states have internal predecessors, (1667), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1685 transitions. [2025-03-08 08:31:20,313 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1685 transitions. Word has length 456 [2025-03-08 08:31:20,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:20,314 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1685 transitions. [2025-03-08 08:31:20,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:20,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1685 transitions. [2025-03-08 08:31:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-08 08:31:20,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:20,319 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 08:31:20,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-08 08:31:20,319 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:20,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:20,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2145974953, now seen corresponding path program 1 times [2025-03-08 08:31:20,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:20,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081702974] [2025-03-08 08:31:20,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:20,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:20,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-08 08:31:20,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-08 08:31:20,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:20,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:20,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:20,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081702974] [2025-03-08 08:31:20,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081702974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:20,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:20,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:20,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281179836] [2025-03-08 08:31:20,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:20,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:20,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:20,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:20,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:20,919 INFO L87 Difference]: Start difference. First operand 1225 states and 1685 transitions. Second operand has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:21,108 INFO L93 Difference]: Finished difference Result 2125 states and 2944 transitions. [2025-03-08 08:31:21,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:21,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 457 [2025-03-08 08:31:21,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:21,110 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:21,110 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:21,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:21,112 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 635 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:21,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1247 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:21,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:21,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.371499176276771) internal successors, (1665), 1214 states have internal predecessors, (1665), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1683 transitions. [2025-03-08 08:31:21,129 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1683 transitions. Word has length 457 [2025-03-08 08:31:21,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:21,129 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1683 transitions. [2025-03-08 08:31:21,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1683 transitions. [2025-03-08 08:31:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-08 08:31:21,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:21,132 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 08:31:21,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-08 08:31:21,132 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:21,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash 454393206, now seen corresponding path program 1 times [2025-03-08 08:31:21,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:21,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035859847] [2025-03-08 08:31:21,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:21,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:21,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-08 08:31:21,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-08 08:31:21,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:21,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:21,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:21,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035859847] [2025-03-08 08:31:21,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035859847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:21,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:21,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:21,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020516616] [2025-03-08 08:31:21,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:21,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:21,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:21,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:21,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:21,657 INFO L87 Difference]: Start difference. First operand 1225 states and 1683 transitions. Second operand has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:21,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:21,846 INFO L93 Difference]: Finished difference Result 2125 states and 2940 transitions. [2025-03-08 08:31:21,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:21,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 458 [2025-03-08 08:31:21,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:21,848 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:21,848 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:21,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:21,850 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 1146 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:21,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 1240 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:21,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:21,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.369851729818781) internal successors, (1663), 1214 states have internal predecessors, (1663), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:21,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1681 transitions. [2025-03-08 08:31:21,865 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1681 transitions. Word has length 458 [2025-03-08 08:31:21,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:21,865 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1681 transitions. [2025-03-08 08:31:21,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1681 transitions. [2025-03-08 08:31:21,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 08:31:21,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:21,868 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 08:31:21,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-08 08:31:21,868 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:21,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:21,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1305447336, now seen corresponding path program 1 times [2025-03-08 08:31:21,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:21,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422637727] [2025-03-08 08:31:21,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:21,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:21,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 08:31:22,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 08:31:22,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:22,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:22,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:22,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422637727] [2025-03-08 08:31:22,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422637727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:22,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:22,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:22,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964653688] [2025-03-08 08:31:22,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:22,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:22,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:22,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:22,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:22,471 INFO L87 Difference]: Start difference. First operand 1225 states and 1681 transitions. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:22,692 INFO L93 Difference]: Finished difference Result 2125 states and 2936 transitions. [2025-03-08 08:31:22,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:22,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 459 [2025-03-08 08:31:22,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:22,694 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:22,695 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:22,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:22,698 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 619 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:22,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1247 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:22,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:22,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.3682042833607908) internal successors, (1661), 1214 states have internal predecessors, (1661), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1679 transitions. [2025-03-08 08:31:22,715 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1679 transitions. Word has length 459 [2025-03-08 08:31:22,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:22,716 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1679 transitions. [2025-03-08 08:31:22,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:22,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1679 transitions. [2025-03-08 08:31:22,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 08:31:22,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:22,719 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 08:31:22,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-08 08:31:22,719 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:22,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:22,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1791783173, now seen corresponding path program 1 times [2025-03-08 08:31:22,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:22,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350948173] [2025-03-08 08:31:22,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:22,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:22,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 08:31:22,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 08:31:22,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:22,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:23,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:23,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350948173] [2025-03-08 08:31:23,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350948173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:23,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:23,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:23,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772221167] [2025-03-08 08:31:23,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:23,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:23,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:23,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:23,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:23,337 INFO L87 Difference]: Start difference. First operand 1225 states and 1679 transitions. Second operand has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:23,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:23,538 INFO L93 Difference]: Finished difference Result 2125 states and 2932 transitions. [2025-03-08 08:31:23,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:23,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 460 [2025-03-08 08:31:23,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:23,541 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:23,541 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:23,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:23,542 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 1107 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:23,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 1258 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:23,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.3665568369028007) internal successors, (1659), 1214 states have internal predecessors, (1659), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1677 transitions. [2025-03-08 08:31:23,561 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1677 transitions. Word has length 460 [2025-03-08 08:31:23,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:23,561 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1677 transitions. [2025-03-08 08:31:23,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1677 transitions. [2025-03-08 08:31:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-08 08:31:23,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:23,564 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 08:31:23,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-08 08:31:23,564 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:23,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:23,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2122549383, now seen corresponding path program 1 times [2025-03-08 08:31:23,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:23,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513279181] [2025-03-08 08:31:23,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:23,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:23,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-08 08:31:23,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-08 08:31:23,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:23,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:24,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:24,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513279181] [2025-03-08 08:31:24,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513279181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:24,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:24,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:24,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631845993] [2025-03-08 08:31:24,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:24,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:24,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:24,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:24,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:24,168 INFO L87 Difference]: Start difference. First operand 1225 states and 1677 transitions. Second operand has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:24,340 INFO L93 Difference]: Finished difference Result 2125 states and 2928 transitions. [2025-03-08 08:31:24,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:24,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 461 [2025-03-08 08:31:24,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:24,342 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:24,342 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:24,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:24,343 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 596 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:24,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1265 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:24,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:24,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:24,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.3649093904448106) internal successors, (1657), 1214 states have internal predecessors, (1657), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1675 transitions. [2025-03-08 08:31:24,358 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1675 transitions. Word has length 461 [2025-03-08 08:31:24,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:24,359 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1675 transitions. [2025-03-08 08:31:24,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:24,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1675 transitions. [2025-03-08 08:31:24,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-08 08:31:24,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:24,361 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 08:31:24,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-08 08:31:24,361 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:24,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:24,362 INFO L85 PathProgramCache]: Analyzing trace with hash 611104532, now seen corresponding path program 1 times [2025-03-08 08:31:24,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:24,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184928832] [2025-03-08 08:31:24,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:24,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:24,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-08 08:31:24,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-08 08:31:24,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:24,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:25,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:25,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184928832] [2025-03-08 08:31:25,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184928832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:25,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:25,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:25,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336334980] [2025-03-08 08:31:25,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:25,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:25,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:25,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:25,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:25,148 INFO L87 Difference]: Start difference. First operand 1225 states and 1675 transitions. Second operand has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:25,434 INFO L93 Difference]: Finished difference Result 2125 states and 2924 transitions. [2025-03-08 08:31:25,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:25,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 462 [2025-03-08 08:31:25,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:25,437 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:25,437 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:25,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:25,439 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 1068 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:25,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 966 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:31:25,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:25,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:25,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.3632619439868203) internal successors, (1655), 1214 states have internal predecessors, (1655), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1673 transitions. [2025-03-08 08:31:25,456 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1673 transitions. Word has length 462 [2025-03-08 08:31:25,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:25,456 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1673 transitions. [2025-03-08 08:31:25,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1673 transitions. [2025-03-08 08:31:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-03-08 08:31:25,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:25,458 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 08:31:25,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-08 08:31:25,458 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:25,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:25,459 INFO L85 PathProgramCache]: Analyzing trace with hash -715983050, now seen corresponding path program 1 times [2025-03-08 08:31:25,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:25,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898800520] [2025-03-08 08:31:25,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:25,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:25,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-08 08:31:25,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-08 08:31:25,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:25,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:26,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:26,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898800520] [2025-03-08 08:31:26,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898800520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:26,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:26,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:31:26,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804696610] [2025-03-08 08:31:26,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:26,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:31:26,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:26,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:31:26,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:31:26,499 INFO L87 Difference]: Start difference. First operand 1225 states and 1673 transitions. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:26,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:26,702 INFO L93 Difference]: Finished difference Result 2125 states and 2920 transitions. [2025-03-08 08:31:26,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:26,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 463 [2025-03-08 08:31:26,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:26,704 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:26,704 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:26,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:26,707 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 494 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:26,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1256 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:26,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:26,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.3616144975288302) internal successors, (1653), 1214 states have internal predecessors, (1653), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:26,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1671 transitions. [2025-03-08 08:31:26,730 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1671 transitions. Word has length 463 [2025-03-08 08:31:26,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:26,730 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1671 transitions. [2025-03-08 08:31:26,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1671 transitions. [2025-03-08 08:31:26,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-08 08:31:26,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:26,734 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03-08 08:31:26,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-08 08:31:26,734 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:26,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:26,734 INFO L85 PathProgramCache]: Analyzing trace with hash -887273708, now seen corresponding path program 1 times [2025-03-08 08:31:26,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:26,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420525275] [2025-03-08 08:31:26,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:26,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:26,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-08 08:31:27,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-08 08:31:27,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:27,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:27,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:27,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420525275] [2025-03-08 08:31:27,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420525275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:27,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:27,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:27,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643533948] [2025-03-08 08:31:27,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:27,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:27,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:27,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:27,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:27,788 INFO L87 Difference]: Start difference. First operand 1225 states and 1671 transitions. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:28,000 INFO L93 Difference]: Finished difference Result 2125 states and 2916 transitions. [2025-03-08 08:31:28,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:28,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 464 [2025-03-08 08:31:28,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:28,003 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:28,003 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:28,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:28,005 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 1173 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:28,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 1232 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:28,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:28,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.3599670510708401) internal successors, (1651), 1214 states have internal predecessors, (1651), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1669 transitions. [2025-03-08 08:31:28,021 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1669 transitions. Word has length 464 [2025-03-08 08:31:28,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:28,021 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1669 transitions. [2025-03-08 08:31:28,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:28,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1669 transitions. [2025-03-08 08:31:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-08 08:31:28,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:28,024 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03-08 08:31:28,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-08 08:31:28,024 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:28,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:28,025 INFO L85 PathProgramCache]: Analyzing trace with hash -868014603, now seen corresponding path program 1 times [2025-03-08 08:31:28,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:28,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518720917] [2025-03-08 08:31:28,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:28,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:28,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-08 08:31:28,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-08 08:31:28,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:28,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:29,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:29,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518720917] [2025-03-08 08:31:29,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518720917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:29,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:29,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:29,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208875576] [2025-03-08 08:31:29,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:29,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:29,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:29,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:29,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:29,047 INFO L87 Difference]: Start difference. First operand 1225 states and 1669 transitions. Second operand has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:29,246 INFO L93 Difference]: Finished difference Result 2125 states and 2912 transitions. [2025-03-08 08:31:29,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:29,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 465 [2025-03-08 08:31:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:29,248 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:29,248 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:29,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:29,249 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 652 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:29,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1239 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:29,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.35831960461285) internal successors, (1649), 1214 states have internal predecessors, (1649), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:29,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1667 transitions. [2025-03-08 08:31:29,262 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1667 transitions. Word has length 465 [2025-03-08 08:31:29,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:29,262 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1667 transitions. [2025-03-08 08:31:29,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1667 transitions. [2025-03-08 08:31:29,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-08 08:31:29,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:29,265 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 08:31:29,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-08 08:31:29,265 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:29,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:29,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1023937929, now seen corresponding path program 1 times [2025-03-08 08:31:29,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:29,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768528689] [2025-03-08 08:31:29,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:29,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:29,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 08:31:29,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 08:31:29,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:29,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:30,202 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:30,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:30,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768528689] [2025-03-08 08:31:30,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768528689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:30,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:30,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:31:30,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599926599] [2025-03-08 08:31:30,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:30,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:31:30,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:30,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:31:30,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:31:30,204 INFO L87 Difference]: Start difference. First operand 1225 states and 1667 transitions. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:30,410 INFO L93 Difference]: Finished difference Result 2125 states and 2908 transitions. [2025-03-08 08:31:30,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:30,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 466 [2025-03-08 08:31:30,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:30,413 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:30,413 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:30,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:30,414 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 503 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:30,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1232 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:30,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:30,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:30,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.35667215815486) internal successors, (1647), 1214 states have internal predecessors, (1647), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1665 transitions. [2025-03-08 08:31:30,441 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1665 transitions. Word has length 466 [2025-03-08 08:31:30,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:30,442 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1665 transitions. [2025-03-08 08:31:30,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1665 transitions. [2025-03-08 08:31:30,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-08 08:31:30,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:30,447 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 08:31:30,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-08 08:31:30,447 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:30,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:30,447 INFO L85 PathProgramCache]: Analyzing trace with hash -765556284, now seen corresponding path program 1 times [2025-03-08 08:31:30,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:30,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896689855] [2025-03-08 08:31:30,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:30,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:30,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-08 08:31:31,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-08 08:31:31,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:31,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:31,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:31,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896689855] [2025-03-08 08:31:31,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896689855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:31,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:31,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:31,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509340160] [2025-03-08 08:31:31,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:31,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:31,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:31,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:31,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:31,574 INFO L87 Difference]: Start difference. First operand 1225 states and 1665 transitions. Second operand has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:31,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:31,799 INFO L93 Difference]: Finished difference Result 2125 states and 2904 transitions. [2025-03-08 08:31:31,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:31,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 467 [2025-03-08 08:31:31,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:31,801 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:31,801 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:31,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:31,803 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 1208 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:31,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 1186 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:31,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.3550247116968699) internal successors, (1645), 1214 states have internal predecessors, (1645), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1663 transitions. [2025-03-08 08:31:31,820 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1663 transitions. Word has length 467 [2025-03-08 08:31:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:31,820 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1663 transitions. [2025-03-08 08:31:31,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1663 transitions. [2025-03-08 08:31:31,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-08 08:31:31,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:31,823 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 08:31:31,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-08 08:31:31,823 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:31,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:31,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1456551568, now seen corresponding path program 1 times [2025-03-08 08:31:31,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:31,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704556427] [2025-03-08 08:31:31,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:31,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:31,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-08 08:31:32,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-08 08:31:32,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:32,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:32,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:32,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704556427] [2025-03-08 08:31:32,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704556427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:32,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:32,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:32,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142636549] [2025-03-08 08:31:32,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:32,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:32,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:32,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:32,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:32,746 INFO L87 Difference]: Start difference. First operand 1225 states and 1663 transitions. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:32,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:32,969 INFO L93 Difference]: Finished difference Result 2125 states and 2900 transitions. [2025-03-08 08:31:32,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:32,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 468 [2025-03-08 08:31:32,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:32,971 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:32,971 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:32,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:32,972 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 634 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:32,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 1193 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:32,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:32,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.3533772652388798) internal successors, (1643), 1214 states have internal predecessors, (1643), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:32,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1661 transitions. [2025-03-08 08:31:32,992 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1661 transitions. Word has length 468 [2025-03-08 08:31:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:32,993 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1661 transitions. [2025-03-08 08:31:32,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:32,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1661 transitions. [2025-03-08 08:31:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-08 08:31:32,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:32,997 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03-08 08:31:32,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-08 08:31:32,997 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:32,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:32,998 INFO L85 PathProgramCache]: Analyzing trace with hash -723453361, now seen corresponding path program 1 times [2025-03-08 08:31:32,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:32,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879407311] [2025-03-08 08:31:32,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:32,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:33,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-08 08:31:33,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-08 08:31:33,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:33,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:34,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:34,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879407311] [2025-03-08 08:31:34,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879407311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:34,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:34,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:31:34,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146620278] [2025-03-08 08:31:34,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:34,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:31:34,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:34,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:31:34,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:31:34,047 INFO L87 Difference]: Start difference. First operand 1225 states and 1661 transitions. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:34,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:34,233 INFO L93 Difference]: Finished difference Result 2125 states and 2896 transitions. [2025-03-08 08:31:34,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:34,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 469 [2025-03-08 08:31:34,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:34,235 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:34,235 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:34,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:34,236 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 556 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:34,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1186 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:34,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:34,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.3517298187808897) internal successors, (1641), 1214 states have internal predecessors, (1641), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1659 transitions. [2025-03-08 08:31:34,250 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1659 transitions. Word has length 469 [2025-03-08 08:31:34,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:34,250 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1659 transitions. [2025-03-08 08:31:34,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:34,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1659 transitions. [2025-03-08 08:31:34,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-08 08:31:34,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:34,252 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03-08 08:31:34,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-08 08:31:34,252 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:34,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:34,253 INFO L85 PathProgramCache]: Analyzing trace with hash 464798031, now seen corresponding path program 1 times [2025-03-08 08:31:34,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:34,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118916889] [2025-03-08 08:31:34,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:34,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:34,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-08 08:31:34,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-08 08:31:34,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:34,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:35,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:35,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118916889] [2025-03-08 08:31:35,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118916889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:35,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:35,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:35,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117406700] [2025-03-08 08:31:35,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:35,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:35,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:35,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:35,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:35,173 INFO L87 Difference]: Start difference. First operand 1225 states and 1659 transitions. Second operand has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:35,394 INFO L93 Difference]: Finished difference Result 2125 states and 2892 transitions. [2025-03-08 08:31:35,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:35,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 470 [2025-03-08 08:31:35,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:35,396 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:35,396 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:35,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:35,397 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 632 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:35,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1193 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:35,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.3500823723228994) internal successors, (1639), 1214 states have internal predecessors, (1639), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1657 transitions. [2025-03-08 08:31:35,413 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1657 transitions. Word has length 470 [2025-03-08 08:31:35,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:35,414 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1657 transitions. [2025-03-08 08:31:35,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:35,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1657 transitions. [2025-03-08 08:31:35,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 08:31:35,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:35,416 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03-08 08:31:35,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-08 08:31:35,417 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:35,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:35,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1398455343, now seen corresponding path program 1 times [2025-03-08 08:31:35,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:35,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755408518] [2025-03-08 08:31:35,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:35,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:35,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 08:31:35,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 08:31:35,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:35,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:36,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:36,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755408518] [2025-03-08 08:31:36,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755408518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:36,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:36,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:36,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553708797] [2025-03-08 08:31:36,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:36,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:36,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:36,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:36,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:36,390 INFO L87 Difference]: Start difference. First operand 1225 states and 1657 transitions. Second operand has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:36,618 INFO L93 Difference]: Finished difference Result 2125 states and 2888 transitions. [2025-03-08 08:31:36,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:36,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 471 [2025-03-08 08:31:36,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:36,620 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:36,620 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:36,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:36,621 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 1168 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:36,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 1186 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:36,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:36,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.3484349258649093) internal successors, (1637), 1214 states have internal predecessors, (1637), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:36,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1655 transitions. [2025-03-08 08:31:36,637 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1655 transitions. Word has length 471 [2025-03-08 08:31:36,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:36,638 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1655 transitions. [2025-03-08 08:31:36,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:36,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1655 transitions. [2025-03-08 08:31:36,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-08 08:31:36,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:36,640 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03-08 08:31:36,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-08 08:31:36,640 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:36,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:36,640 INFO L85 PathProgramCache]: Analyzing trace with hash 696334482, now seen corresponding path program 1 times [2025-03-08 08:31:36,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:36,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856323177] [2025-03-08 08:31:36,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:36,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:36,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-08 08:31:37,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-08 08:31:37,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:37,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:37,649 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:37,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:37,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856323177] [2025-03-08 08:31:37,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856323177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:37,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:37,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:37,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008076618] [2025-03-08 08:31:37,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:37,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:37,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:37,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:37,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:37,650 INFO L87 Difference]: Start difference. First operand 1225 states and 1655 transitions. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:37,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:37,874 INFO L93 Difference]: Finished difference Result 2125 states and 2884 transitions. [2025-03-08 08:31:37,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:37,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 472 [2025-03-08 08:31:37,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:37,876 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:37,876 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:37,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:37,877 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 1158 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:37,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1186 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:37,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:37,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.3467874794069192) internal successors, (1635), 1214 states have internal predecessors, (1635), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1653 transitions. [2025-03-08 08:31:37,893 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1653 transitions. Word has length 472 [2025-03-08 08:31:37,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:37,893 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1653 transitions. [2025-03-08 08:31:37,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:37,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1653 transitions. [2025-03-08 08:31:37,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-08 08:31:37,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:37,896 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2025-03-08 08:31:37,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-08 08:31:37,896 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:37,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:37,896 INFO L85 PathProgramCache]: Analyzing trace with hash -603572277, now seen corresponding path program 1 times [2025-03-08 08:31:37,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:37,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498235865] [2025-03-08 08:31:37,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:37,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:37,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-08 08:31:38,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-08 08:31:38,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:38,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:38,991 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:38,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:38,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498235865] [2025-03-08 08:31:38,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498235865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:38,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:38,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:31:38,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72993357] [2025-03-08 08:31:38,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:38,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:31:38,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:38,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:31:38,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:31:38,994 INFO L87 Difference]: Start difference. First operand 1225 states and 1653 transitions. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:39,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:39,227 INFO L93 Difference]: Finished difference Result 2125 states and 2880 transitions. [2025-03-08 08:31:39,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:31:39,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 473 [2025-03-08 08:31:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:39,229 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 08:31:39,229 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 08:31:39,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:39,231 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 520 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:39,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1186 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:39,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 08:31:39,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-08 08:31:39,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1214 states have (on average 1.3451400329489291) internal successors, (1633), 1214 states have internal predecessors, (1633), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 08:31:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1651 transitions. [2025-03-08 08:31:39,255 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1651 transitions. Word has length 473 [2025-03-08 08:31:39,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:39,255 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1651 transitions. [2025-03-08 08:31:39,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1651 transitions. [2025-03-08 08:31:39,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-03-08 08:31:39,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:39,260 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-03-08 08:31:39,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-08 08:31:39,260 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:39,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:39,260 INFO L85 PathProgramCache]: Analyzing trace with hash -215139016, now seen corresponding path program 1 times [2025-03-08 08:31:39,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:39,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093330548] [2025-03-08 08:31:39,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:39,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:39,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-03-08 08:31:40,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-03-08 08:31:40,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:40,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:40,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:40,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093330548] [2025-03-08 08:31:40,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093330548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:40,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:40,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 08:31:40,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709067061] [2025-03-08 08:31:40,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:40,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 08:31:40,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:40,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 08:31:40,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:40,510 INFO L87 Difference]: Start difference. First operand 1225 states and 1651 transitions. Second operand has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:41,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:41,008 INFO L93 Difference]: Finished difference Result 2968 states and 4018 transitions. [2025-03-08 08:31:41,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 08:31:41,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 474 [2025-03-08 08:31:41,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:41,010 INFO L225 Difference]: With dead ends: 2968 [2025-03-08 08:31:41,010 INFO L226 Difference]: Without dead ends: 2068 [2025-03-08 08:31:41,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:31:41,011 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 683 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:41,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 2405 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:31:41,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2025-03-08 08:31:41,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 1937. [2025-03-08 08:31:41,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1937 states, 1923 states have (on average 1.3395735829433177) internal successors, (2576), 1923 states have internal predecessors, (2576), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 08:31:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 2600 transitions. [2025-03-08 08:31:41,029 INFO L78 Accepts]: Start accepts. Automaton has 1937 states and 2600 transitions. Word has length 474 [2025-03-08 08:31:41,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:41,030 INFO L471 AbstractCegarLoop]: Abstraction has 1937 states and 2600 transitions. [2025-03-08 08:31:41,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:41,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 2600 transitions. [2025-03-08 08:31:41,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-03-08 08:31:41,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:41,033 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2025-03-08 08:31:41,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-03-08 08:31:41,033 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:41,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:41,033 INFO L85 PathProgramCache]: Analyzing trace with hash -867453766, now seen corresponding path program 1 times [2025-03-08 08:31:41,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:41,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889339939] [2025-03-08 08:31:41,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:41,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:41,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-03-08 08:31:41,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-03-08 08:31:41,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:41,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 08:31:42,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:42,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889339939] [2025-03-08 08:31:42,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889339939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:42,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:42,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 08:31:42,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45860979] [2025-03-08 08:31:42,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:42,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 08:31:42,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:42,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 08:31:42,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:31:42,296 INFO L87 Difference]: Start difference. First operand 1937 states and 2600 transitions. Second operand has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:42,862 INFO L93 Difference]: Finished difference Result 2883 states and 3893 transitions. [2025-03-08 08:31:42,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 08:31:42,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 475 [2025-03-08 08:31:42,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:42,865 INFO L225 Difference]: With dead ends: 2883 [2025-03-08 08:31:42,865 INFO L226 Difference]: Without dead ends: 1983 [2025-03-08 08:31:42,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:31:42,866 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 1336 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:42,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 1858 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:31:42,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2025-03-08 08:31:42,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1939. [2025-03-08 08:31:42,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1925 states have (on average 1.3392207792207793) internal successors, (2578), 1925 states have internal predecessors, (2578), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 08:31:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2602 transitions. [2025-03-08 08:31:42,889 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2602 transitions. Word has length 475 [2025-03-08 08:31:42,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:42,889 INFO L471 AbstractCegarLoop]: Abstraction has 1939 states and 2602 transitions. [2025-03-08 08:31:42,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:42,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2602 transitions. [2025-03-08 08:31:42,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-03-08 08:31:42,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:42,893 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2025-03-08 08:31:42,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-03-08 08:31:42,893 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:42,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:42,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1866034103, now seen corresponding path program 1 times [2025-03-08 08:31:42,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:42,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612309883] [2025-03-08 08:31:42,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:42,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:42,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-03-08 08:31:43,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-03-08 08:31:43,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:43,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 08:31:44,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:44,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612309883] [2025-03-08 08:31:44,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612309883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:44,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:44,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 08:31:44,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471680227] [2025-03-08 08:31:44,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:44,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 08:31:44,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:44,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 08:31:44,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:31:44,331 INFO L87 Difference]: Start difference. First operand 1939 states and 2602 transitions. Second operand has 8 states, 8 states have (on average 45.875) internal successors, (367), 8 states have internal predecessors, (367), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:45,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:45,072 INFO L93 Difference]: Finished difference Result 4508 states and 6036 transitions. [2025-03-08 08:31:45,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 08:31:45,072 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 45.875) internal successors, (367), 8 states have internal predecessors, (367), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 475 [2025-03-08 08:31:45,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:45,075 INFO L225 Difference]: With dead ends: 4508 [2025-03-08 08:31:45,075 INFO L226 Difference]: Without dead ends: 3435 [2025-03-08 08:31:45,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:31:45,077 INFO L435 NwaCegarLoop]: 1494 mSDtfsCounter, 1142 mSDsluCounter, 7025 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 8519 SdHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:45,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 8519 Invalid, 2005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2005 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 08:31:45,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2025-03-08 08:31:45,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 2006. [2025-03-08 08:31:45,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2006 states, 1989 states have (on average 1.3418803418803418) internal successors, (2669), 1989 states have internal predecessors, (2669), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 08:31:45,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 2699 transitions. [2025-03-08 08:31:45,105 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 2699 transitions. Word has length 475 [2025-03-08 08:31:45,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:45,105 INFO L471 AbstractCegarLoop]: Abstraction has 2006 states and 2699 transitions. [2025-03-08 08:31:45,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.875) internal successors, (367), 8 states have internal predecessors, (367), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2699 transitions. [2025-03-08 08:31:45,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-08 08:31:45,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:45,109 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-08 08:31:45,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-03-08 08:31:45,109 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:45,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:45,109 INFO L85 PathProgramCache]: Analyzing trace with hash 751736748, now seen corresponding path program 1 times [2025-03-08 08:31:45,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:45,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459138306] [2025-03-08 08:31:45,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:45,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:45,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-08 08:31:45,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-08 08:31:45,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:45,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-08 08:31:46,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:46,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459138306] [2025-03-08 08:31:46,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459138306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:46,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:46,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:31:46,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212878930] [2025-03-08 08:31:46,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:46,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:31:46,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:46,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:31:46,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:46,718 INFO L87 Difference]: Start difference. First operand 2006 states and 2699 transitions. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:46,945 INFO L93 Difference]: Finished difference Result 3830 states and 5075 transitions. [2025-03-08 08:31:46,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:31:46,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 476 [2025-03-08 08:31:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:46,948 INFO L225 Difference]: With dead ends: 3830 [2025-03-08 08:31:46,948 INFO L226 Difference]: Without dead ends: 2452 [2025-03-08 08:31:46,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:31:46,950 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 17 mSDsluCounter, 1861 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:46,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2484 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:31:46,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2025-03-08 08:31:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2440. [2025-03-08 08:31:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2423 states have (on average 1.296739579034255) internal successors, (3142), 2423 states have internal predecessors, (3142), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 08:31:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3172 transitions. [2025-03-08 08:31:46,984 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3172 transitions. Word has length 476 [2025-03-08 08:31:46,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:46,984 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 3172 transitions. [2025-03-08 08:31:46,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:46,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3172 transitions. [2025-03-08 08:31:46,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-08 08:31:46,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:46,988 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-08 08:31:46,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-03-08 08:31:46,988 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:46,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:46,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1074477108, now seen corresponding path program 1 times [2025-03-08 08:31:46,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:46,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342350159] [2025-03-08 08:31:46,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:46,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:47,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-08 08:31:47,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-08 08:31:47,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:47,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:48,263 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-03-08 08:31:48,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:48,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342350159] [2025-03-08 08:31:48,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342350159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:48,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:48,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 08:31:48,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239375224] [2025-03-08 08:31:48,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:48,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 08:31:48,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:48,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 08:31:48,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:31:48,265 INFO L87 Difference]: Start difference. First operand 2440 states and 3172 transitions. Second operand has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:48,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:48,704 INFO L93 Difference]: Finished difference Result 5046 states and 6568 transitions. [2025-03-08 08:31:48,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 08:31:48,705 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 478 [2025-03-08 08:31:48,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:48,710 INFO L225 Difference]: With dead ends: 5046 [2025-03-08 08:31:48,711 INFO L226 Difference]: Without dead ends: 2460 [2025-03-08 08:31:48,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 08:31:48,717 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 807 mSDsluCounter, 2332 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 2953 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:48,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 2953 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 08:31:48,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2025-03-08 08:31:48,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 2450. [2025-03-08 08:31:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2433 states have (on average 1.2934648581997534) internal successors, (3147), 2433 states have internal predecessors, (3147), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 08:31:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3177 transitions. [2025-03-08 08:31:48,747 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3177 transitions. Word has length 478 [2025-03-08 08:31:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:48,747 INFO L471 AbstractCegarLoop]: Abstraction has 2450 states and 3177 transitions. [2025-03-08 08:31:48,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3177 transitions. [2025-03-08 08:31:48,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-03-08 08:31:48,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:48,750 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-08 08:31:48,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-03-08 08:31:48,750 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:48,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:48,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1695726604, now seen corresponding path program 1 times [2025-03-08 08:31:48,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:48,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88110312] [2025-03-08 08:31:48,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:48,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:48,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-08 08:31:49,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-08 08:31:49,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:49,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-08 08:31:50,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:50,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88110312] [2025-03-08 08:31:50,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88110312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:50,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:50,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 08:31:50,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189042910] [2025-03-08 08:31:50,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:50,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 08:31:50,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:50,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 08:31:50,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:31:50,186 INFO L87 Difference]: Start difference. First operand 2450 states and 3177 transitions. Second operand has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:51,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:51,161 INFO L93 Difference]: Finished difference Result 6269 states and 8093 transitions. [2025-03-08 08:31:51,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 08:31:51,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 480 [2025-03-08 08:31:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:51,166 INFO L225 Difference]: With dead ends: 6269 [2025-03-08 08:31:51,166 INFO L226 Difference]: Without dead ends: 4726 [2025-03-08 08:31:51,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:31:51,168 INFO L435 NwaCegarLoop]: 959 mSDtfsCounter, 1262 mSDsluCounter, 4095 mSDsCounter, 0 mSdLazyCounter, 2469 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 5054 SdHoareTripleChecker+Invalid, 2469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:51,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 5054 Invalid, 2469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2469 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 08:31:51,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4726 states. [2025-03-08 08:31:51,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4726 to 2658. [2025-03-08 08:31:51,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2658 states, 2632 states have (on average 1.3016717325227964) internal successors, (3426), 2632 states have internal predecessors, (3426), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 08:31:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 3474 transitions. [2025-03-08 08:31:51,209 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 3474 transitions. Word has length 480 [2025-03-08 08:31:51,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:51,210 INFO L471 AbstractCegarLoop]: Abstraction has 2658 states and 3474 transitions. [2025-03-08 08:31:51,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 08:31:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 3474 transitions. [2025-03-08 08:31:51,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-03-08 08:31:51,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:51,215 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-08 08:31:51,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-03-08 08:31:51,216 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:51,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:51,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1587652332, now seen corresponding path program 1 times [2025-03-08 08:31:51,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:51,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845896668] [2025-03-08 08:31:51,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:51,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:51,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-03-08 08:31:51,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-03-08 08:31:51,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:51,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:52,533 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-08 08:31:52,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:52,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845896668] [2025-03-08 08:31:52,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845896668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:52,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:52,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 08:31:52,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840208281] [2025-03-08 08:31:52,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:52,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 08:31:52,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:52,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 08:31:52,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:31:52,534 INFO L87 Difference]: Start difference. First operand 2658 states and 3474 transitions. Second operand has 7 states, 7 states have (on average 52.857142857142854) internal successors, (370), 7 states have internal predecessors, (370), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 08:31:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:53,148 INFO L93 Difference]: Finished difference Result 4993 states and 6482 transitions. [2025-03-08 08:31:53,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 08:31:53,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 52.857142857142854) internal successors, (370), 7 states have internal predecessors, (370), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 482 [2025-03-08 08:31:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:53,151 INFO L225 Difference]: With dead ends: 4993 [2025-03-08 08:31:53,152 INFO L226 Difference]: Without dead ends: 2690 [2025-03-08 08:31:53,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 08:31:53,154 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 1419 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1420 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:53,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1420 Valid, 1853 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:31:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2025-03-08 08:31:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2674. [2025-03-08 08:31:53,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2648 states have (on average 1.2968277945619335) internal successors, (3434), 2648 states have internal predecessors, (3434), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 08:31:53,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3482 transitions. [2025-03-08 08:31:53,216 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3482 transitions. Word has length 482 [2025-03-08 08:31:53,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:53,216 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 3482 transitions. [2025-03-08 08:31:53,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.857142857142854) internal successors, (370), 7 states have internal predecessors, (370), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 08:31:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3482 transitions. [2025-03-08 08:31:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-08 08:31:53,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:53,222 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-08 08:31:53,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-03-08 08:31:53,223 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:53,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:53,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1368581972, now seen corresponding path program 1 times [2025-03-08 08:31:53,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:53,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258730951] [2025-03-08 08:31:53,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:53,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:53,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-08 08:31:54,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-08 08:31:54,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:31:54,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:31:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-08 08:31:55,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:31:55,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258730951] [2025-03-08 08:31:55,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258730951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:31:55,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:31:55,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 08:31:55,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036549396] [2025-03-08 08:31:55,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:31:55,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 08:31:55,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:31:55,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 08:31:55,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:31:55,037 INFO L87 Difference]: Start difference. First operand 2674 states and 3482 transitions. Second operand has 8 states, 8 states have (on average 49.5) internal successors, (396), 8 states have internal predecessors, (396), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 08:31:56,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:31:56,089 INFO L93 Difference]: Finished difference Result 6521 states and 8428 transitions. [2025-03-08 08:31:56,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 08:31:56,089 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 49.5) internal successors, (396), 8 states have internal predecessors, (396), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 484 [2025-03-08 08:31:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:31:56,094 INFO L225 Difference]: With dead ends: 6521 [2025-03-08 08:31:56,095 INFO L226 Difference]: Without dead ends: 4973 [2025-03-08 08:31:56,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:31:56,098 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 1294 mSDsluCounter, 3927 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 4838 SdHoareTripleChecker+Invalid, 2396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 08:31:56,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1297 Valid, 4838 Invalid, 2396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 08:31:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4973 states. [2025-03-08 08:31:56,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4973 to 2678. [2025-03-08 08:31:56,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2678 states, 2652 states have (on average 1.2978883861236803) internal successors, (3442), 2652 states have internal predecessors, (3442), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 08:31:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2678 states and 3490 transitions. [2025-03-08 08:31:56,140 INFO L78 Accepts]: Start accepts. Automaton has 2678 states and 3490 transitions. Word has length 484 [2025-03-08 08:31:56,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:31:56,141 INFO L471 AbstractCegarLoop]: Abstraction has 2678 states and 3490 transitions. [2025-03-08 08:31:56,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.5) internal successors, (396), 8 states have internal predecessors, (396), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 08:31:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2678 states and 3490 transitions. [2025-03-08 08:31:56,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-08 08:31:56,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:31:56,144 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-08 08:31:56,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-03-08 08:31:56,144 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:31:56,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:31:56,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1627635084, now seen corresponding path program 1 times [2025-03-08 08:31:56,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:31:56,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632777296] [2025-03-08 08:31:56,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:31:56,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:31:56,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes.