./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2f2704c4e2c6d7f64d9e04a1e2386cc75b096498be0071ea7fbc37af2938bd44 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:08:25,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:08:25,502 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:08:25,507 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:08:25,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:08:25,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:08:25,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:08:25,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:08:25,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:08:25,528 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:08:25,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:08:25,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:08:25,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:08:25,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:08:25,529 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:08:25,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:08:25,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:08:25,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:08:25,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:08:25,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:08:25,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:08:25,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:08:25,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:08:25,530 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:08:25,530 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:08:25,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:08:25,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:08:25,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:08:25,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:08:25,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:08:25,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:08:25,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:08:25,531 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:08:25,531 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:08:25,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:08:25,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:08:25,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:08:25,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:08:25,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:08:25,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:08:25,532 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f2704c4e2c6d7f64d9e04a1e2386cc75b096498be0071ea7fbc37af2938bd44 [2025-02-05 20:08:25,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:08:25,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:08:25,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:08:25,792 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:08:25,792 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:08:25,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c [2025-02-05 20:08:27,038 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4659c70a/5f3978efde5c47a6943a6a43242bf0c6/FLAGba1b91549 [2025-02-05 20:08:27,320 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:08:27,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c [2025-02-05 20:08:27,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4659c70a/5f3978efde5c47a6943a6a43242bf0c6/FLAGba1b91549 [2025-02-05 20:08:27,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4659c70a/5f3978efde5c47a6943a6a43242bf0c6 [2025-02-05 20:08:27,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:08:27,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:08:27,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:08:27,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:08:27,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:08:27,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:08:27" (1/1) ... [2025-02-05 20:08:27,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3aa120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:27, skipping insertion in model container [2025-02-05 20:08:27,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:08:27" (1/1) ... [2025-02-05 20:08:27,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:08:27,509 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c[1313,1326] [2025-02-05 20:08:27,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:08:27,739 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:08:27,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c[1313,1326] [2025-02-05 20:08:27,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:08:27,853 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:08:27,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:27 WrapperNode [2025-02-05 20:08:27,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:08:27,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:08:27,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:08:27,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:08:27,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:27" (1/1) ... [2025-02-05 20:08:27,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:27" (1/1) ... [2025-02-05 20:08:28,072 INFO L138 Inliner]: procedures = 17, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2365 [2025-02-05 20:08:28,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:08:28,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:08:28,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:08:28,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:08:28,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:27" (1/1) ... [2025-02-05 20:08:28,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:27" (1/1) ... [2025-02-05 20:08:28,095 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:27" (1/1) ... [2025-02-05 20:08:28,142 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:08:28,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:27" (1/1) ... [2025-02-05 20:08:28,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:27" (1/1) ... [2025-02-05 20:08:28,188 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:27" (1/1) ... [2025-02-05 20:08:28,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:27" (1/1) ... [2025-02-05 20:08:28,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:27" (1/1) ... [2025-02-05 20:08:28,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:27" (1/1) ... [2025-02-05 20:08:28,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:08:28,266 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:08:28,266 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:08:28,266 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:08:28,267 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:27" (1/1) ... [2025-02-05 20:08:28,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:08:28,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:08:28,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:08:28,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:08:28,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:08:28,332 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:08:28,332 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:08:28,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:08:28,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:08:28,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:08:28,532 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:08:28,533 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:08:30,604 INFO L? ?]: Removed 1210 outVars from TransFormulas that were not future-live. [2025-02-05 20:08:30,605 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:08:30,776 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:08:30,776 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:08:30,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:08:30 BoogieIcfgContainer [2025-02-05 20:08:30,777 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:08:30,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:08:30,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:08:30,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:08:30,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:08:27" (1/3) ... [2025-02-05 20:08:30,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff313cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:08:30, skipping insertion in model container [2025-02-05 20:08:30,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:27" (2/3) ... [2025-02-05 20:08:30,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff313cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:08:30, skipping insertion in model container [2025-02-05 20:08:30,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:08:30" (3/3) ... [2025-02-05 20:08:30,787 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c [2025-02-05 20:08:30,807 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:08:30,811 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c that has 2 procedures, 812 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:08:30,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:08:30,905 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;@7f2fa085, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:08:30,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:08:30,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 812 states, 807 states have (on average 1.503097893432466) internal successors, (1213), 808 states have internal predecessors, (1213), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 20:08:30,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-02-05 20:08:30,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:30,940 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:30,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:30,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:30,947 INFO L85 PathProgramCache]: Analyzing trace with hash -143017033, now seen corresponding path program 1 times [2025-02-05 20:08:30,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:30,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336704547] [2025-02-05 20:08:30,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:30,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:31,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-02-05 20:08:31,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-02-05 20:08:31,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:31,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 20:08:31,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:31,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336704547] [2025-02-05 20:08:31,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336704547] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:08:31,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411026910] [2025-02-05 20:08:31,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:31,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:08:31,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:08:31,542 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:08:31,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 20:08:31,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-02-05 20:08:31,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-02-05 20:08:31,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:31,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:31,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 1396 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:08:31,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:08:31,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 20:08:31,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:08:31,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411026910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:31,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:08:31,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:08:31,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289320284] [2025-02-05 20:08:31,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:31,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:08:31,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:31,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:08:31,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:08:31,989 INFO L87 Difference]: Start difference. First operand has 812 states, 807 states have (on average 1.503097893432466) internal successors, (1213), 808 states have internal predecessors, (1213), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 143.0) internal successors, (286), 2 states have internal predecessors, (286), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 20:08:32,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:32,569 INFO L93 Difference]: Finished difference Result 1583 states and 2378 transitions. [2025-02-05 20:08:32,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:08:32,574 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 143.0) internal successors, (286), 2 states have internal predecessors, (286), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 291 [2025-02-05 20:08:32,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:32,587 INFO L225 Difference]: With dead ends: 1583 [2025-02-05 20:08:32,589 INFO L226 Difference]: Without dead ends: 809 [2025-02-05 20:08:32,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 292 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-02-05 20:08:32,600 INFO L435 NwaCegarLoop]: 1012 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:32,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1012 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:08:32,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-02-05 20:08:32,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2025-02-05 20:08:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 805 states have (on average 1.4956521739130435) internal successors, (1204), 805 states have internal predecessors, (1204), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 20:08:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1208 transitions. [2025-02-05 20:08:32,690 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1208 transitions. Word has length 291 [2025-02-05 20:08:32,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:32,692 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1208 transitions. [2025-02-05 20:08:32,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 143.0) internal successors, (286), 2 states have internal predecessors, (286), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 20:08:32,693 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1208 transitions. [2025-02-05 20:08:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-02-05 20:08:32,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:32,700 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:32,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 20:08:32,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 20:08:32,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:32,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:32,902 INFO L85 PathProgramCache]: Analyzing trace with hash 234776245, now seen corresponding path program 1 times [2025-02-05 20:08:32,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:32,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927941182] [2025-02-05 20:08:32,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:32,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:33,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-02-05 20:08:33,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-02-05 20:08:33,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:33,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:34,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:34,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927941182] [2025-02-05 20:08:34,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927941182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:34,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:34,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:08:34,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077738008] [2025-02-05 20:08:34,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:34,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:08:34,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:34,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:08:34,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:08:34,465 INFO L87 Difference]: Start difference. First operand 809 states and 1208 transitions. Second operand has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:34,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:34,849 INFO L93 Difference]: Finished difference Result 813 states and 1212 transitions. [2025-02-05 20:08:34,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:08:34,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 291 [2025-02-05 20:08:34,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:34,854 INFO L225 Difference]: With dead ends: 813 [2025-02-05 20:08:34,854 INFO L226 Difference]: Without dead ends: 811 [2025-02-05 20:08:34,854 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-02-05 20:08:34,855 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 0 mSDsluCounter, 2015 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3025 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:34,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3025 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:08:34,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-02-05 20:08:34,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2025-02-05 20:08:34,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 807 states have (on average 1.4944237918215613) internal successors, (1206), 807 states have internal predecessors, (1206), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 20:08:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1210 transitions. [2025-02-05 20:08:34,872 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1210 transitions. Word has length 291 [2025-02-05 20:08:34,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:34,874 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1210 transitions. [2025-02-05 20:08:34,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1210 transitions. [2025-02-05 20:08:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-02-05 20:08:34,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:34,878 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:34,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:08:34,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:34,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:34,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1307191423, now seen corresponding path program 1 times [2025-02-05 20:08:34,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:34,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810441127] [2025-02-05 20:08:34,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:34,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:34,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-02-05 20:08:35,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-02-05 20:08:35,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:35,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:35,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:35,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:35,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810441127] [2025-02-05 20:08:35,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810441127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:35,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:35,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:08:35,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099716519] [2025-02-05 20:08:35,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:35,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:08:35,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:35,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:08:35,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:08:35,502 INFO L87 Difference]: Start difference. First operand 811 states and 1210 transitions. Second operand has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 20:08:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:36,255 INFO L93 Difference]: Finished difference Result 2327 states and 3478 transitions. [2025-02-05 20:08:36,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:08:36,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 292 [2025-02-05 20:08:36,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:36,259 INFO L225 Difference]: With dead ends: 2327 [2025-02-05 20:08:36,259 INFO L226 Difference]: Without dead ends: 811 [2025-02-05 20:08:36,259 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-02-05 20:08:36,260 INFO L435 NwaCegarLoop]: 1896 mSDtfsCounter, 2043 mSDsluCounter, 2846 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2044 SdHoareTripleChecker+Valid, 4742 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:36,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2044 Valid, 4742 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:08:36,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-02-05 20:08:36,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2025-02-05 20:08:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 807 states have (on average 1.493184634448575) internal successors, (1205), 807 states have internal predecessors, (1205), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 20:08:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1209 transitions. [2025-02-05 20:08:36,274 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1209 transitions. Word has length 292 [2025-02-05 20:08:36,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:36,274 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1209 transitions. [2025-02-05 20:08:36,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 20:08:36,275 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1209 transitions. [2025-02-05 20:08:36,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-02-05 20:08:36,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:36,278 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:36,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:08:36,278 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:36,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:36,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1952361004, now seen corresponding path program 1 times [2025-02-05 20:08:36,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:36,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610054210] [2025-02-05 20:08:36,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:36,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:36,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-02-05 20:08:36,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-02-05 20:08:36,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:36,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:36,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:36,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610054210] [2025-02-05 20:08:36,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610054210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:36,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:36,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:08:36,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928587952] [2025-02-05 20:08:36,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:36,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:08:36,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:36,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:08:36,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:08:36,792 INFO L87 Difference]: Start difference. First operand 811 states and 1209 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:37,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:37,122 INFO L93 Difference]: Finished difference Result 1586 states and 2365 transitions. [2025-02-05 20:08:37,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:08:37,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 293 [2025-02-05 20:08:37,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:37,125 INFO L225 Difference]: With dead ends: 1586 [2025-02-05 20:08:37,125 INFO L226 Difference]: Without dead ends: 813 [2025-02-05 20:08:37,126 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-02-05 20:08:37,126 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 0 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:37,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3019 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:08:37,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-02-05 20:08:37,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2025-02-05 20:08:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 809 states have (on average 1.491965389369592) internal successors, (1207), 809 states have internal predecessors, (1207), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 20:08:37,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1211 transitions. [2025-02-05 20:08:37,139 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1211 transitions. Word has length 293 [2025-02-05 20:08:37,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:37,140 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1211 transitions. [2025-02-05 20:08:37,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:37,140 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1211 transitions. [2025-02-05 20:08:37,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-02-05 20:08:37,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:37,142 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:37,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:08:37,143 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:37,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:37,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1537860669, now seen corresponding path program 1 times [2025-02-05 20:08:37,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:37,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107227561] [2025-02-05 20:08:37,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:37,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:37,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-02-05 20:08:37,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-02-05 20:08:37,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:37,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:37,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:37,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107227561] [2025-02-05 20:08:37,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107227561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:37,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:37,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:08:37,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112123761] [2025-02-05 20:08:37,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:37,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:08:37,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:37,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:08:37,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:08:37,751 INFO L87 Difference]: Start difference. First operand 813 states and 1211 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:38,085 INFO L93 Difference]: Finished difference Result 1588 states and 2366 transitions. [2025-02-05 20:08:38,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:08:38,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 294 [2025-02-05 20:08:38,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:38,088 INFO L225 Difference]: With dead ends: 1588 [2025-02-05 20:08:38,088 INFO L226 Difference]: Without dead ends: 813 [2025-02-05 20:08:38,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:08:38,090 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 1162 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:38,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 1998 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:08:38,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-02-05 20:08:38,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2025-02-05 20:08:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 809 states have (on average 1.4907292954264524) internal successors, (1206), 809 states have internal predecessors, (1206), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 20:08:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1210 transitions. [2025-02-05 20:08:38,104 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1210 transitions. Word has length 294 [2025-02-05 20:08:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:38,104 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1210 transitions. [2025-02-05 20:08:38,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:38,106 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1210 transitions. [2025-02-05 20:08:38,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-05 20:08:38,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:38,109 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:38,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:08:38,109 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:38,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:38,110 INFO L85 PathProgramCache]: Analyzing trace with hash 585000132, now seen corresponding path program 1 times [2025-02-05 20:08:38,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:38,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374435336] [2025-02-05 20:08:38,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:38,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:38,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-05 20:08:38,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-05 20:08:38,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:38,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:38,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:38,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374435336] [2025-02-05 20:08:38,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374435336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:38,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:38,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:08:38,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126500322] [2025-02-05 20:08:38,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:38,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:08:38,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:38,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:08:38,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:08:38,601 INFO L87 Difference]: Start difference. First operand 813 states and 1210 transitions. Second operand has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:38,960 INFO L93 Difference]: Finished difference Result 1588 states and 2364 transitions. [2025-02-05 20:08:38,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:08:38,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 295 [2025-02-05 20:08:38,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:38,963 INFO L225 Difference]: With dead ends: 1588 [2025-02-05 20:08:38,963 INFO L226 Difference]: Without dead ends: 813 [2025-02-05 20:08:38,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:08:38,966 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 1160 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:38,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 1998 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:08:38,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-02-05 20:08:38,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2025-02-05 20:08:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 809 states have (on average 1.4894932014833127) internal successors, (1205), 809 states have internal predecessors, (1205), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 20:08:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1209 transitions. [2025-02-05 20:08:38,981 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1209 transitions. Word has length 295 [2025-02-05 20:08:38,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:38,982 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1209 transitions. [2025-02-05 20:08:38,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:38,982 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1209 transitions. [2025-02-05 20:08:38,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-02-05 20:08:38,985 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:38,985 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:38,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:08:38,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:38,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:38,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1350903267, now seen corresponding path program 1 times [2025-02-05 20:08:38,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:38,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401314911] [2025-02-05 20:08:38,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:38,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:39,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-05 20:08:39,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-05 20:08:39,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:39,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:39,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:39,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401314911] [2025-02-05 20:08:39,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401314911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:39,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:39,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:08:39,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162843208] [2025-02-05 20:08:39,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:39,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:08:39,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:39,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:08:39,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:08:39,643 INFO L87 Difference]: Start difference. First operand 813 states and 1209 transitions. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:40,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:40,227 INFO L93 Difference]: Finished difference Result 2239 states and 3332 transitions. [2025-02-05 20:08:40,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:08:40,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 296 [2025-02-05 20:08:40,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:40,233 INFO L225 Difference]: With dead ends: 2239 [2025-02-05 20:08:40,233 INFO L226 Difference]: Without dead ends: 1464 [2025-02-05 20:08:40,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:08:40,235 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 941 mSDsluCounter, 2955 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 3951 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:40,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 3951 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:08:40,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2025-02-05 20:08:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 852. [2025-02-05 20:08:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 846 states have (on average 1.4846335697399526) internal successors, (1256), 846 states have internal predecessors, (1256), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 20:08:40,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1264 transitions. [2025-02-05 20:08:40,255 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1264 transitions. Word has length 296 [2025-02-05 20:08:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:40,255 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1264 transitions. [2025-02-05 20:08:40,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:40,255 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1264 transitions. [2025-02-05 20:08:40,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-02-05 20:08:40,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:40,258 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:40,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:08:40,258 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:40,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:40,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1223175161, now seen corresponding path program 1 times [2025-02-05 20:08:40,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:40,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393737861] [2025-02-05 20:08:40,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:40,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:40,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-05 20:08:40,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-05 20:08:40,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:40,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:40,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:40,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393737861] [2025-02-05 20:08:40,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393737861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:40,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:40,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:08:40,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316626472] [2025-02-05 20:08:40,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:40,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:08:40,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:40,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:08:40,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:08:40,533 INFO L87 Difference]: Start difference. First operand 852 states and 1264 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:40,817 INFO L93 Difference]: Finished difference Result 1666 states and 2472 transitions. [2025-02-05 20:08:40,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:08:40,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 297 [2025-02-05 20:08:40,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:40,821 INFO L225 Difference]: With dead ends: 1666 [2025-02-05 20:08:40,821 INFO L226 Difference]: Without dead ends: 852 [2025-02-05 20:08:40,822 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-02-05 20:08:40,822 INFO L435 NwaCegarLoop]: 1003 mSDtfsCounter, 1155 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:40,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 2010 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:08:40,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-02-05 20:08:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2025-02-05 20:08:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 846 states have (on average 1.483451536643026) internal successors, (1255), 846 states have internal predecessors, (1255), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 20:08:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1263 transitions. [2025-02-05 20:08:40,835 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1263 transitions. Word has length 297 [2025-02-05 20:08:40,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:40,836 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1263 transitions. [2025-02-05 20:08:40,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:40,836 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1263 transitions. [2025-02-05 20:08:40,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-02-05 20:08:40,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:40,838 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:40,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 20:08:40,839 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:40,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:40,839 INFO L85 PathProgramCache]: Analyzing trace with hash -507625932, now seen corresponding path program 1 times [2025-02-05 20:08:40,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:40,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404093315] [2025-02-05 20:08:40,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:40,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:40,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-05 20:08:40,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-05 20:08:40,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:40,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:41,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:41,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404093315] [2025-02-05 20:08:41,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404093315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:41,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:41,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:08:41,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607900850] [2025-02-05 20:08:41,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:41,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:08:41,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:41,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:08:41,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:08:41,239 INFO L87 Difference]: Start difference. First operand 852 states and 1263 transitions. Second operand has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 6 states have internal predecessors, (290), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:42,076 INFO L93 Difference]: Finished difference Result 2317 states and 3439 transitions. [2025-02-05 20:08:42,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:08:42,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 6 states have internal predecessors, (290), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 297 [2025-02-05 20:08:42,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:42,081 INFO L225 Difference]: With dead ends: 2317 [2025-02-05 20:08:42,081 INFO L226 Difference]: Without dead ends: 1503 [2025-02-05 20:08:42,082 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-02-05 20:08:42,082 INFO L435 NwaCegarLoop]: 1796 mSDtfsCounter, 710 mSDsluCounter, 5566 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 7362 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:42,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 7362 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:08:42,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-02-05 20:08:42,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1355. [2025-02-05 20:08:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1347 states have (on average 1.4855233853006682) internal successors, (2001), 1347 states have internal predecessors, (2001), 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-02-05 20:08:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 2013 transitions. [2025-02-05 20:08:42,110 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 2013 transitions. Word has length 297 [2025-02-05 20:08:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:42,110 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 2013 transitions. [2025-02-05 20:08:42,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 6 states have internal predecessors, (290), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2013 transitions. [2025-02-05 20:08:42,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-05 20:08:42,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:42,114 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:42,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 20:08:42,114 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:42,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:42,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1927717299, now seen corresponding path program 1 times [2025-02-05 20:08:42,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:42,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522516318] [2025-02-05 20:08:42,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:42,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:42,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-05 20:08:42,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-05 20:08:42,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:42,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:43,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:43,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522516318] [2025-02-05 20:08:43,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522516318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:43,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:43,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:08:43,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453269683] [2025-02-05 20:08:43,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:43,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:08:43,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:43,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:08:43,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:08:43,046 INFO L87 Difference]: Start difference. First operand 1355 states and 2013 transitions. Second operand has 7 states, 7 states have (on average 41.57142857142857) internal successors, (291), 7 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:43,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:43,784 INFO L93 Difference]: Finished difference Result 3284 states and 4883 transitions. [2025-02-05 20:08:43,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:08:43,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 41.57142857142857) internal successors, (291), 7 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 298 [2025-02-05 20:08:43,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:43,790 INFO L225 Difference]: With dead ends: 3284 [2025-02-05 20:08:43,790 INFO L226 Difference]: Without dead ends: 1967 [2025-02-05 20:08:43,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:08:43,792 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 1246 mSDsluCounter, 4149 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 5120 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:43,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 5120 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:08:43,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2025-02-05 20:08:43,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1403. [2025-02-05 20:08:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1403 states, 1395 states have (on average 1.4845878136200716) internal successors, (2071), 1395 states have internal predecessors, (2071), 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-02-05 20:08:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 2083 transitions. [2025-02-05 20:08:43,840 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 2083 transitions. Word has length 298 [2025-02-05 20:08:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:43,840 INFO L471 AbstractCegarLoop]: Abstraction has 1403 states and 2083 transitions. [2025-02-05 20:08:43,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 41.57142857142857) internal successors, (291), 7 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 2083 transitions. [2025-02-05 20:08:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-05 20:08:43,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:43,845 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:43,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 20:08:43,845 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:43,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:43,846 INFO L85 PathProgramCache]: Analyzing trace with hash -262074492, now seen corresponding path program 1 times [2025-02-05 20:08:43,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:43,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091777185] [2025-02-05 20:08:43,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:43,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:43,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-05 20:08:44,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-05 20:08:44,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:44,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:44,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:44,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:44,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091777185] [2025-02-05 20:08:44,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091777185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:44,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:44,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:08:44,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126927162] [2025-02-05 20:08:44,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:44,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:08:44,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:44,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:08:44,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:08:44,431 INFO L87 Difference]: Start difference. First operand 1403 states and 2083 transitions. Second operand has 7 states, 7 states have (on average 41.57142857142857) internal successors, (291), 7 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:45,286 INFO L93 Difference]: Finished difference Result 2919 states and 4333 transitions. [2025-02-05 20:08:45,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:08:45,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 41.57142857142857) internal successors, (291), 7 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 298 [2025-02-05 20:08:45,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:45,291 INFO L225 Difference]: With dead ends: 2919 [2025-02-05 20:08:45,291 INFO L226 Difference]: Without dead ends: 1554 [2025-02-05 20:08:45,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:08:45,293 INFO L435 NwaCegarLoop]: 1799 mSDtfsCounter, 927 mSDsluCounter, 6359 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 8158 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:45,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 8158 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:08:45,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2025-02-05 20:08:45,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1406. [2025-02-05 20:08:45,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1398 states have (on average 1.4835479256080115) internal successors, (2074), 1398 states have internal predecessors, (2074), 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-02-05 20:08:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2086 transitions. [2025-02-05 20:08:45,316 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2086 transitions. Word has length 298 [2025-02-05 20:08:45,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:45,316 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 2086 transitions. [2025-02-05 20:08:45,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 41.57142857142857) internal successors, (291), 7 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:45,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2086 transitions. [2025-02-05 20:08:45,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-05 20:08:45,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:45,320 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:45,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 20:08:45,320 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:45,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:45,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2019737643, now seen corresponding path program 1 times [2025-02-05 20:08:45,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:45,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224502332] [2025-02-05 20:08:45,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:45,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:45,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-05 20:08:45,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-05 20:08:45,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:45,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:46,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:46,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224502332] [2025-02-05 20:08:46,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224502332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:46,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:46,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:08:46,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561307851] [2025-02-05 20:08:46,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:46,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:08:46,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:46,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:08:46,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:08:46,117 INFO L87 Difference]: Start difference. First operand 1406 states and 2086 transitions. Second operand has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:46,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:46,607 INFO L93 Difference]: Finished difference Result 2774 states and 4116 transitions. [2025-02-05 20:08:46,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:08:46,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 298 [2025-02-05 20:08:46,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:46,612 INFO L225 Difference]: With dead ends: 2774 [2025-02-05 20:08:46,612 INFO L226 Difference]: Without dead ends: 1406 [2025-02-05 20:08:46,613 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-02-05 20:08:46,614 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 1151 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 2973 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:46,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 2973 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:08:46,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2025-02-05 20:08:46,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1406. [2025-02-05 20:08:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1398 states have (on average 1.4821173104434906) internal successors, (2072), 1398 states have internal predecessors, (2072), 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-02-05 20:08:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2084 transitions. [2025-02-05 20:08:46,635 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2084 transitions. Word has length 298 [2025-02-05 20:08:46,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:46,635 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 2084 transitions. [2025-02-05 20:08:46,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2084 transitions. [2025-02-05 20:08:46,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-02-05 20:08:46,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:46,638 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:46,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 20:08:46,639 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:46,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:46,639 INFO L85 PathProgramCache]: Analyzing trace with hash -438937453, now seen corresponding path program 1 times [2025-02-05 20:08:46,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:46,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970809412] [2025-02-05 20:08:46,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:46,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:46,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-05 20:08:46,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-05 20:08:46,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:46,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:47,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:47,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970809412] [2025-02-05 20:08:47,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970809412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:47,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:47,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:08:47,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177063358] [2025-02-05 20:08:47,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:47,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:08:47,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:47,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:08:47,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:08:47,104 INFO L87 Difference]: Start difference. First operand 1406 states and 2084 transitions. Second operand has 6 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:47,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:47,755 INFO L93 Difference]: Finished difference Result 3338 states and 4954 transitions. [2025-02-05 20:08:47,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:08:47,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 299 [2025-02-05 20:08:47,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:47,761 INFO L225 Difference]: With dead ends: 3338 [2025-02-05 20:08:47,761 INFO L226 Difference]: Without dead ends: 1970 [2025-02-05 20:08:47,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:08:47,763 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 1239 mSDsluCounter, 3902 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 4873 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:47,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1239 Valid, 4873 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:08:47,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2025-02-05 20:08:47,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1414. [2025-02-05 20:08:47,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1406 states have (on average 1.4815078236130867) internal successors, (2083), 1406 states have internal predecessors, (2083), 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-02-05 20:08:47,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2095 transitions. [2025-02-05 20:08:47,786 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2095 transitions. Word has length 299 [2025-02-05 20:08:47,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:47,787 INFO L471 AbstractCegarLoop]: Abstraction has 1414 states and 2095 transitions. [2025-02-05 20:08:47,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2095 transitions. [2025-02-05 20:08:47,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-02-05 20:08:47,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:47,790 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:47,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 20:08:47,790 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:47,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:47,791 INFO L85 PathProgramCache]: Analyzing trace with hash 318071171, now seen corresponding path program 1 times [2025-02-05 20:08:47,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:47,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811698947] [2025-02-05 20:08:47,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:47,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:47,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-02-05 20:08:47,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-02-05 20:08:47,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:47,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:48,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:48,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811698947] [2025-02-05 20:08:48,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811698947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:48,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:48,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 20:08:48,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111664647] [2025-02-05 20:08:48,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:48,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:08:48,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:48,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:08:48,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:08:48,564 INFO L87 Difference]: Start difference. First operand 1414 states and 2095 transitions. Second operand has 10 states, 10 states have (on average 29.3) internal successors, (293), 10 states have internal predecessors, (293), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:49,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:49,736 INFO L93 Difference]: Finished difference Result 3350 states and 4970 transitions. [2025-02-05 20:08:49,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:08:49,736 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 29.3) internal successors, (293), 10 states have internal predecessors, (293), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 300 [2025-02-05 20:08:49,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:49,741 INFO L225 Difference]: With dead ends: 3350 [2025-02-05 20:08:49,741 INFO L226 Difference]: Without dead ends: 1974 [2025-02-05 20:08:49,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:08:49,743 INFO L435 NwaCegarLoop]: 961 mSDtfsCounter, 3341 mSDsluCounter, 6705 mSDsCounter, 0 mSdLazyCounter, 1933 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3343 SdHoareTripleChecker+Valid, 7666 SdHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:49,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3343 Valid, 7666 Invalid, 1933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1933 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 20:08:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2025-02-05 20:08:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1416. [2025-02-05 20:08:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1408 states have (on average 1.4808238636363635) internal successors, (2085), 1408 states have internal predecessors, (2085), 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-02-05 20:08:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2097 transitions. [2025-02-05 20:08:49,772 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2097 transitions. Word has length 300 [2025-02-05 20:08:49,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:49,772 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 2097 transitions. [2025-02-05 20:08:49,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 29.3) internal successors, (293), 10 states have internal predecessors, (293), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2097 transitions. [2025-02-05 20:08:49,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-02-05 20:08:49,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:49,777 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:49,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 20:08:49,777 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:49,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:49,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1586676671, now seen corresponding path program 1 times [2025-02-05 20:08:49,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:49,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881311284] [2025-02-05 20:08:49,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:49,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:49,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-02-05 20:08:49,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-02-05 20:08:49,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:49,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:50,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:50,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881311284] [2025-02-05 20:08:50,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881311284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:50,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:50,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:08:50,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698715127] [2025-02-05 20:08:50,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:50,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:08:50,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:50,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:08:50,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:08:50,196 INFO L87 Difference]: Start difference. First operand 1416 states and 2097 transitions. Second operand has 5 states, 5 states have (on average 58.6) internal successors, (293), 5 states have internal predecessors, (293), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:50,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:50,632 INFO L93 Difference]: Finished difference Result 3507 states and 5188 transitions. [2025-02-05 20:08:50,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:08:50,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.6) internal successors, (293), 5 states have internal predecessors, (293), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 300 [2025-02-05 20:08:50,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:50,638 INFO L225 Difference]: With dead ends: 3507 [2025-02-05 20:08:50,639 INFO L226 Difference]: Without dead ends: 2129 [2025-02-05 20:08:50,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:08:50,641 INFO L435 NwaCegarLoop]: 1003 mSDtfsCounter, 319 mSDsluCounter, 3001 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 4004 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:50,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 4004 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:08:50,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2025-02-05 20:08:50,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 2083. [2025-02-05 20:08:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 2069 states have (on average 1.4755920734654422) internal successors, (3053), 2069 states have internal predecessors, (3053), 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-02-05 20:08:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3077 transitions. [2025-02-05 20:08:50,698 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3077 transitions. Word has length 300 [2025-02-05 20:08:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:50,698 INFO L471 AbstractCegarLoop]: Abstraction has 2083 states and 3077 transitions. [2025-02-05 20:08:50,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.6) internal successors, (293), 5 states have internal predecessors, (293), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3077 transitions. [2025-02-05 20:08:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-02-05 20:08:50,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:50,701 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:50,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 20:08:50,702 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:50,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:50,702 INFO L85 PathProgramCache]: Analyzing trace with hash 802532704, now seen corresponding path program 1 times [2025-02-05 20:08:50,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:50,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861873400] [2025-02-05 20:08:50,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:50,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:50,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-02-05 20:08:50,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-02-05 20:08:50,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:50,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:50,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:50,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861873400] [2025-02-05 20:08:50,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861873400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:50,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:50,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:08:50,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995109575] [2025-02-05 20:08:50,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:50,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:08:50,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:50,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:08:50,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:08:50,899 INFO L87 Difference]: Start difference. First operand 2083 states and 3077 transitions. Second operand has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:51,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:51,173 INFO L93 Difference]: Finished difference Result 3461 states and 5118 transitions. [2025-02-05 20:08:51,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:08:51,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 301 [2025-02-05 20:08:51,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:51,179 INFO L225 Difference]: With dead ends: 3461 [2025-02-05 20:08:51,179 INFO L226 Difference]: Without dead ends: 2083 [2025-02-05 20:08:51,180 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-02-05 20:08:51,180 INFO L435 NwaCegarLoop]: 1002 mSDtfsCounter, 1035 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:51,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 2008 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:08:51,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2025-02-05 20:08:51,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 2083. [2025-02-05 20:08:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 2069 states have (on average 1.474625422909618) internal successors, (3051), 2069 states have internal predecessors, (3051), 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-02-05 20:08:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3075 transitions. [2025-02-05 20:08:51,211 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3075 transitions. Word has length 301 [2025-02-05 20:08:51,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:51,212 INFO L471 AbstractCegarLoop]: Abstraction has 2083 states and 3075 transitions. [2025-02-05 20:08:51,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3075 transitions. [2025-02-05 20:08:51,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-02-05 20:08:51,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:51,216 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:51,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 20:08:51,216 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:51,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:51,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2143198773, now seen corresponding path program 1 times [2025-02-05 20:08:51,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:51,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994046137] [2025-02-05 20:08:51,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:51,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:51,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-02-05 20:08:51,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-02-05 20:08:51,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:51,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:52,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:52,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994046137] [2025-02-05 20:08:52,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994046137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:52,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:52,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:08:52,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150230887] [2025-02-05 20:08:52,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:52,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:08:52,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:52,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:08:52,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:08:52,009 INFO L87 Difference]: Start difference. First operand 2083 states and 3075 transitions. Second operand has 8 states, 8 states have (on average 36.75) internal successors, (294), 8 states have internal predecessors, (294), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:52,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:52,656 INFO L93 Difference]: Finished difference Result 3475 states and 5134 transitions. [2025-02-05 20:08:52,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:08:52,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 36.75) internal successors, (294), 8 states have internal predecessors, (294), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 301 [2025-02-05 20:08:52,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:52,662 INFO L225 Difference]: With dead ends: 3475 [2025-02-05 20:08:52,662 INFO L226 Difference]: Without dead ends: 2097 [2025-02-05 20:08:52,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:08:52,664 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 1858 mSDsluCounter, 3721 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1858 SdHoareTripleChecker+Valid, 4661 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:52,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1858 Valid, 4661 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:08:52,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2025-02-05 20:08:52,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 2095. [2025-02-05 20:08:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2095 states, 2081 states have (on average 1.4738106679481018) internal successors, (3067), 2081 states have internal predecessors, (3067), 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-02-05 20:08:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 3091 transitions. [2025-02-05 20:08:52,689 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 3091 transitions. Word has length 301 [2025-02-05 20:08:52,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:52,690 INFO L471 AbstractCegarLoop]: Abstraction has 2095 states and 3091 transitions. [2025-02-05 20:08:52,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 36.75) internal successors, (294), 8 states have internal predecessors, (294), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 3091 transitions. [2025-02-05 20:08:52,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-05 20:08:52,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:52,693 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:52,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 20:08:52,693 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:52,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:52,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1522329966, now seen corresponding path program 1 times [2025-02-05 20:08:52,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:52,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011854892] [2025-02-05 20:08:52,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:52,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:52,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-05 20:08:52,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-05 20:08:52,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:52,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:53,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:53,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011854892] [2025-02-05 20:08:53,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011854892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:53,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:53,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:08:53,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553795300] [2025-02-05 20:08:53,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:53,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:08:53,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:53,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:08:53,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:08:53,185 INFO L87 Difference]: Start difference. First operand 2095 states and 3091 transitions. Second operand has 7 states, 7 states have (on average 42.142857142857146) internal successors, (295), 7 states have internal predecessors, (295), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:53,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:53,827 INFO L93 Difference]: Finished difference Result 3487 states and 5150 transitions. [2025-02-05 20:08:53,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:08:53,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 42.142857142857146) internal successors, (295), 7 states have internal predecessors, (295), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 302 [2025-02-05 20:08:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:53,846 INFO L225 Difference]: With dead ends: 3487 [2025-02-05 20:08:53,846 INFO L226 Difference]: Without dead ends: 2097 [2025-02-05 20:08:53,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:08:53,849 INFO L435 NwaCegarLoop]: 999 mSDtfsCounter, 924 mSDsluCounter, 2993 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 3992 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:53,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 3992 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:08:53,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2025-02-05 20:08:53,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 2097. [2025-02-05 20:08:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2097 states, 2083 states have (on average 1.4723955832933269) internal successors, (3067), 2083 states have internal predecessors, (3067), 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-02-05 20:08:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 3091 transitions. [2025-02-05 20:08:53,902 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 3091 transitions. Word has length 302 [2025-02-05 20:08:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:53,903 INFO L471 AbstractCegarLoop]: Abstraction has 2097 states and 3091 transitions. [2025-02-05 20:08:53,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 42.142857142857146) internal successors, (295), 7 states have internal predecessors, (295), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 3091 transitions. [2025-02-05 20:08:53,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-05 20:08:53,908 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:53,908 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:53,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 20:08:53,909 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:53,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:53,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1794792584, now seen corresponding path program 1 times [2025-02-05 20:08:53,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:53,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029758400] [2025-02-05 20:08:53,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:53,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:53,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-05 20:08:54,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-05 20:08:54,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:54,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:54,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:54,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029758400] [2025-02-05 20:08:54,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029758400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:54,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:54,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:08:54,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946704867] [2025-02-05 20:08:54,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:54,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:08:54,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:54,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:08:54,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:08:54,867 INFO L87 Difference]: Start difference. First operand 2097 states and 3091 transitions. Second operand has 7 states, 7 states have (on average 42.142857142857146) internal successors, (295), 7 states have internal predecessors, (295), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:55,724 INFO L93 Difference]: Finished difference Result 4208 states and 6204 transitions. [2025-02-05 20:08:55,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:08:55,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 42.142857142857146) internal successors, (295), 7 states have internal predecessors, (295), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 302 [2025-02-05 20:08:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:55,732 INFO L225 Difference]: With dead ends: 4208 [2025-02-05 20:08:55,732 INFO L226 Difference]: Without dead ends: 2816 [2025-02-05 20:08:55,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:08:55,734 INFO L435 NwaCegarLoop]: 1309 mSDtfsCounter, 1500 mSDsluCounter, 3899 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 5208 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:55,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 5208 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:08:55,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2025-02-05 20:08:55,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 2794. [2025-02-05 20:08:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2794 states, 2774 states have (on average 1.469718817591925) internal successors, (4077), 2774 states have internal predecessors, (4077), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-05 20:08:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2794 states and 4113 transitions. [2025-02-05 20:08:55,764 INFO L78 Accepts]: Start accepts. Automaton has 2794 states and 4113 transitions. Word has length 302 [2025-02-05 20:08:55,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:55,764 INFO L471 AbstractCegarLoop]: Abstraction has 2794 states and 4113 transitions. [2025-02-05 20:08:55,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 42.142857142857146) internal successors, (295), 7 states have internal predecessors, (295), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:55,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 4113 transitions. [2025-02-05 20:08:55,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-05 20:08:55,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:55,768 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:55,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 20:08:55,769 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:55,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:55,769 INFO L85 PathProgramCache]: Analyzing trace with hash 881953433, now seen corresponding path program 1 times [2025-02-05 20:08:55,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:55,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019744599] [2025-02-05 20:08:55,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:55,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:55,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-05 20:08:55,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-05 20:08:55,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:55,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:56,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:56,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:56,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019744599] [2025-02-05 20:08:56,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019744599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:56,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:56,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:08:56,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360587777] [2025-02-05 20:08:56,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:56,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:08:56,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:56,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:08:56,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:08:56,156 INFO L87 Difference]: Start difference. First operand 2794 states and 4113 transitions. Second operand has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:56,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:56,771 INFO L93 Difference]: Finished difference Result 4616 states and 6810 transitions. [2025-02-05 20:08:56,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:08:56,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 303 [2025-02-05 20:08:56,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:56,778 INFO L225 Difference]: With dead ends: 4616 [2025-02-05 20:08:56,778 INFO L226 Difference]: Without dead ends: 3224 [2025-02-05 20:08:56,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:08:56,780 INFO L435 NwaCegarLoop]: 976 mSDtfsCounter, 632 mSDsluCounter, 3899 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 4875 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:56,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 4875 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:08:56,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2025-02-05 20:08:56,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 2810. [2025-02-05 20:08:56,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2810 states, 2790 states have (on average 1.4684587813620071) internal successors, (4097), 2790 states have internal predecessors, (4097), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-05 20:08:56,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 4133 transitions. [2025-02-05 20:08:56,831 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 4133 transitions. Word has length 303 [2025-02-05 20:08:56,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:56,831 INFO L471 AbstractCegarLoop]: Abstraction has 2810 states and 4133 transitions. [2025-02-05 20:08:56,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:56,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 4133 transitions. [2025-02-05 20:08:56,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-05 20:08:56,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:56,836 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:56,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 20:08:56,837 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:56,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:56,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1814552258, now seen corresponding path program 1 times [2025-02-05 20:08:56,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:56,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536171404] [2025-02-05 20:08:56,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:56,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:56,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-05 20:08:57,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-05 20:08:57,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:57,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:57,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:57,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:57,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536171404] [2025-02-05 20:08:57,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536171404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:57,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:57,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:08:57,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984847503] [2025-02-05 20:08:57,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:57,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:08:57,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:57,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:08:57,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:08:57,377 INFO L87 Difference]: Start difference. First operand 2810 states and 4133 transitions. Second operand has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:58,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:58,048 INFO L93 Difference]: Finished difference Result 4250 states and 6256 transitions. [2025-02-05 20:08:58,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:08:58,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 303 [2025-02-05 20:08:58,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:58,052 INFO L225 Difference]: With dead ends: 4250 [2025-02-05 20:08:58,053 INFO L226 Difference]: Without dead ends: 2832 [2025-02-05 20:08:58,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-02-05 20:08:58,055 INFO L435 NwaCegarLoop]: 1312 mSDtfsCounter, 1505 mSDsluCounter, 3522 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 4834 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:58,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 4834 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:08:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2025-02-05 20:08:58,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2810. [2025-02-05 20:08:58,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2810 states, 2790 states have (on average 1.467741935483871) internal successors, (4095), 2790 states have internal predecessors, (4095), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-05 20:08:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 4131 transitions. [2025-02-05 20:08:58,076 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 4131 transitions. Word has length 303 [2025-02-05 20:08:58,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:58,076 INFO L471 AbstractCegarLoop]: Abstraction has 2810 states and 4131 transitions. [2025-02-05 20:08:58,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:08:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 4131 transitions. [2025-02-05 20:08:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-05 20:08:58,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:58,080 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:58,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 20:08:58,080 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:58,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:58,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1397511012, now seen corresponding path program 1 times [2025-02-05 20:08:58,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:58,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832270528] [2025-02-05 20:08:58,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:58,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:58,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-05 20:08:58,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-05 20:08:58,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:58,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:59,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:59,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832270528] [2025-02-05 20:08:59,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832270528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:59,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:59,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 20:08:59,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274671689] [2025-02-05 20:08:59,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:59,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:08:59,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:59,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:08:59,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:08:59,161 INFO L87 Difference]: Start difference. First operand 2810 states and 4131 transitions. Second operand has 10 states, 10 states have (on average 29.6) internal successors, (296), 10 states have internal predecessors, (296), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 20:09:00,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:00,203 INFO L93 Difference]: Finished difference Result 7380 states and 10870 transitions. [2025-02-05 20:09:00,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:09:00,204 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 29.6) internal successors, (296), 10 states have internal predecessors, (296), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 303 [2025-02-05 20:09:00,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:00,211 INFO L225 Difference]: With dead ends: 7380 [2025-02-05 20:09:00,211 INFO L226 Difference]: Without dead ends: 5230 [2025-02-05 20:09:00,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:09:00,216 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 3317 mSDsluCounter, 5734 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3318 SdHoareTripleChecker+Valid, 6669 SdHoareTripleChecker+Invalid, 1992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:00,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3318 Valid, 6669 Invalid, 1992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1989 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 20:09:00,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5230 states. [2025-02-05 20:09:00,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5230 to 3233. [2025-02-05 20:09:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3233 states, 3207 states have (on average 1.461178671655753) internal successors, (4686), 3207 states have internal predecessors, (4686), 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-02-05 20:09:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3233 states to 3233 states and 4734 transitions. [2025-02-05 20:09:00,262 INFO L78 Accepts]: Start accepts. Automaton has 3233 states and 4734 transitions. Word has length 303 [2025-02-05 20:09:00,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:00,262 INFO L471 AbstractCegarLoop]: Abstraction has 3233 states and 4734 transitions. [2025-02-05 20:09:00,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 29.6) internal successors, (296), 10 states have internal predecessors, (296), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 20:09:00,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 4734 transitions. [2025-02-05 20:09:00,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-02-05 20:09:00,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:00,275 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:00,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 20:09:00,275 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:00,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:00,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1817787484, now seen corresponding path program 1 times [2025-02-05 20:09:00,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:00,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853013797] [2025-02-05 20:09:00,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:00,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:00,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-02-05 20:09:00,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-02-05 20:09:00,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:00,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:00,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:00,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:00,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853013797] [2025-02-05 20:09:00,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853013797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:00,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:00,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:09:00,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14580041] [2025-02-05 20:09:00,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:00,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:09:00,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:00,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:09:00,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:09:00,840 INFO L87 Difference]: Start difference. First operand 3233 states and 4734 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:01,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:01,358 INFO L93 Difference]: Finished difference Result 5581 states and 8190 transitions. [2025-02-05 20:09:01,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:09:01,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 304 [2025-02-05 20:09:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:01,368 INFO L225 Difference]: With dead ends: 5581 [2025-02-05 20:09:01,369 INFO L226 Difference]: Without dead ends: 3272 [2025-02-05 20:09:01,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-02-05 20:09:01,373 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 0 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2997 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:01,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2997 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:09:01,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3272 states. [2025-02-05 20:09:01,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3272 to 3272. [2025-02-05 20:09:01,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3272 states, 3246 states have (on average 1.4574861367837337) internal successors, (4731), 3246 states have internal predecessors, (4731), 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-02-05 20:09:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3272 states to 3272 states and 4779 transitions. [2025-02-05 20:09:01,433 INFO L78 Accepts]: Start accepts. Automaton has 3272 states and 4779 transitions. Word has length 304 [2025-02-05 20:09:01,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:01,433 INFO L471 AbstractCegarLoop]: Abstraction has 3272 states and 4779 transitions. [2025-02-05 20:09:01,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 3272 states and 4779 transitions. [2025-02-05 20:09:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-02-05 20:09:01,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:01,437 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:01,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 20:09:01,437 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:01,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:01,438 INFO L85 PathProgramCache]: Analyzing trace with hash -962311767, now seen corresponding path program 1 times [2025-02-05 20:09:01,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:01,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443550612] [2025-02-05 20:09:01,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:01,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:01,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-02-05 20:09:01,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-02-05 20:09:01,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:01,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:01,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:01,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:01,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443550612] [2025-02-05 20:09:01,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443550612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:01,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:01,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:09:01,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127836812] [2025-02-05 20:09:01,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:01,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:09:01,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:01,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:09:01,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:09:01,897 INFO L87 Difference]: Start difference. First operand 3272 states and 4779 transitions. Second operand has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:02,248 INFO L93 Difference]: Finished difference Result 5574 states and 8168 transitions. [2025-02-05 20:09:02,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:09:02,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 304 [2025-02-05 20:09:02,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:02,257 INFO L225 Difference]: With dead ends: 5574 [2025-02-05 20:09:02,257 INFO L226 Difference]: Without dead ends: 3302 [2025-02-05 20:09:02,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-02-05 20:09:02,259 INFO L435 NwaCegarLoop]: 1000 mSDtfsCounter, 2 mSDsluCounter, 2989 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3989 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:02,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3989 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:09:02,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2025-02-05 20:09:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 3296. [2025-02-05 20:09:02,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3296 states, 3270 states have (on average 1.4559633027522936) internal successors, (4761), 3270 states have internal predecessors, (4761), 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-02-05 20:09:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3296 states to 3296 states and 4809 transitions. [2025-02-05 20:09:02,305 INFO L78 Accepts]: Start accepts. Automaton has 3296 states and 4809 transitions. Word has length 304 [2025-02-05 20:09:02,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:02,305 INFO L471 AbstractCegarLoop]: Abstraction has 3296 states and 4809 transitions. [2025-02-05 20:09:02,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3296 states and 4809 transitions. [2025-02-05 20:09:02,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-02-05 20:09:02,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:02,309 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:02,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 20:09:02,309 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:02,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:02,309 INFO L85 PathProgramCache]: Analyzing trace with hash -937707402, now seen corresponding path program 1 times [2025-02-05 20:09:02,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:02,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949345994] [2025-02-05 20:09:02,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:02,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:02,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-02-05 20:09:02,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-02-05 20:09:02,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:02,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:03,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:03,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949345994] [2025-02-05 20:09:03,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949345994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:03,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:03,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 20:09:03,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365047899] [2025-02-05 20:09:03,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:03,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 20:09:03,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:03,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 20:09:03,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:09:03,327 INFO L87 Difference]: Start difference. First operand 3296 states and 4809 transitions. Second operand has 12 states, 12 states have (on average 24.75) internal successors, (297), 12 states have internal predecessors, (297), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 20:09:04,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:04,711 INFO L93 Difference]: Finished difference Result 7658 states and 11231 transitions. [2025-02-05 20:09:04,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 20:09:04,711 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 24.75) internal successors, (297), 12 states have internal predecessors, (297), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 304 [2025-02-05 20:09:04,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:04,717 INFO L225 Difference]: With dead ends: 7658 [2025-02-05 20:09:04,717 INFO L226 Difference]: Without dead ends: 5362 [2025-02-05 20:09:04,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:09:04,720 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 5207 mSDsluCounter, 7508 mSDsCounter, 0 mSdLazyCounter, 2621 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5208 SdHoareTripleChecker+Valid, 8434 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:04,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5208 Valid, 8434 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2621 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 20:09:04,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2025-02-05 20:09:04,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 3320. [2025-02-05 20:09:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 3294 states have (on average 1.4544626593806922) internal successors, (4791), 3294 states have internal predecessors, (4791), 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-02-05 20:09:04,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 4839 transitions. [2025-02-05 20:09:04,791 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 4839 transitions. Word has length 304 [2025-02-05 20:09:04,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:04,792 INFO L471 AbstractCegarLoop]: Abstraction has 3320 states and 4839 transitions. [2025-02-05 20:09:04,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 24.75) internal successors, (297), 12 states have internal predecessors, (297), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 20:09:04,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 4839 transitions. [2025-02-05 20:09:04,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-02-05 20:09:04,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:04,796 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:04,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 20:09:04,796 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:04,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:04,797 INFO L85 PathProgramCache]: Analyzing trace with hash 511864614, now seen corresponding path program 1 times [2025-02-05 20:09:04,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:04,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051212100] [2025-02-05 20:09:04,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:04,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:04,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-02-05 20:09:04,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-02-05 20:09:04,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:04,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:05,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:05,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051212100] [2025-02-05 20:09:05,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051212100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:05,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:05,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:09:05,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902387209] [2025-02-05 20:09:05,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:05,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:09:05,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:05,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:09:05,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:09:05,389 INFO L87 Difference]: Start difference. First operand 3320 states and 4839 transitions. Second operand has 8 states, 8 states have (on average 37.125) internal successors, (297), 8 states have internal predecessors, (297), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:06,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:06,092 INFO L93 Difference]: Finished difference Result 5652 states and 8270 transitions. [2025-02-05 20:09:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:09:06,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 37.125) internal successors, (297), 8 states have internal predecessors, (297), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 304 [2025-02-05 20:09:06,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:06,096 INFO L225 Difference]: With dead ends: 5652 [2025-02-05 20:09:06,097 INFO L226 Difference]: Without dead ends: 3320 [2025-02-05 20:09:06,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:09:06,099 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 1451 mSDsluCounter, 3548 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1451 SdHoareTripleChecker+Valid, 4456 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:06,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1451 Valid, 4456 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:09:06,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3320 states. [2025-02-05 20:09:06,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3320 to 3320. [2025-02-05 20:09:06,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 3294 states have (on average 1.4508196721311475) internal successors, (4779), 3294 states have internal predecessors, (4779), 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-02-05 20:09:06,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 4827 transitions. [2025-02-05 20:09:06,129 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 4827 transitions. Word has length 304 [2025-02-05 20:09:06,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:06,130 INFO L471 AbstractCegarLoop]: Abstraction has 3320 states and 4827 transitions. [2025-02-05 20:09:06,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 37.125) internal successors, (297), 8 states have internal predecessors, (297), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 4827 transitions. [2025-02-05 20:09:06,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-02-05 20:09:06,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:06,135 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:06,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 20:09:06,136 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:06,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:06,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1972866968, now seen corresponding path program 1 times [2025-02-05 20:09:06,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:06,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136435449] [2025-02-05 20:09:06,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:06,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:06,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-05 20:09:06,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-05 20:09:06,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:06,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:06,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:06,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:06,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136435449] [2025-02-05 20:09:06,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136435449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:06,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:06,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:09:06,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591922597] [2025-02-05 20:09:06,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:06,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:09:06,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:06,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:09:06,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:06,641 INFO L87 Difference]: Start difference. First operand 3320 states and 4827 transitions. Second operand has 6 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 states have internal predecessors, (298), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:07,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:07,290 INFO L93 Difference]: Finished difference Result 6162 states and 9012 transitions. [2025-02-05 20:09:07,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:09:07,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 states have internal predecessors, (298), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 305 [2025-02-05 20:09:07,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:07,296 INFO L225 Difference]: With dead ends: 6162 [2025-02-05 20:09:07,297 INFO L226 Difference]: Without dead ends: 4253 [2025-02-05 20:09:07,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:09:07,299 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 1227 mSDsluCounter, 3896 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 4866 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:07,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 4866 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:09:07,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4253 states. [2025-02-05 20:09:07,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4253 to 3347. [2025-02-05 20:09:07,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3347 states, 3321 states have (on average 1.4498644986449865) internal successors, (4815), 3321 states have internal predecessors, (4815), 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-02-05 20:09:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3347 states to 3347 states and 4863 transitions. [2025-02-05 20:09:07,328 INFO L78 Accepts]: Start accepts. Automaton has 3347 states and 4863 transitions. Word has length 305 [2025-02-05 20:09:07,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:07,328 INFO L471 AbstractCegarLoop]: Abstraction has 3347 states and 4863 transitions. [2025-02-05 20:09:07,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 states have internal predecessors, (298), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3347 states and 4863 transitions. [2025-02-05 20:09:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-02-05 20:09:07,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:07,332 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:07,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 20:09:07,332 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:07,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:07,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1933790935, now seen corresponding path program 1 times [2025-02-05 20:09:07,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:07,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181481060] [2025-02-05 20:09:07,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:07,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:07,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-05 20:09:07,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-05 20:09:07,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:07,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:07,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:07,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181481060] [2025-02-05 20:09:07,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181481060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:07,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:07,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:09:07,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273317433] [2025-02-05 20:09:07,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:07,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:09:07,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:07,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:09:07,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:09:07,829 INFO L87 Difference]: Start difference. First operand 3347 states and 4863 transitions. Second operand has 9 states, 9 states have (on average 33.111111111111114) internal successors, (298), 9 states have internal predecessors, (298), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:08,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:08,648 INFO L93 Difference]: Finished difference Result 6526 states and 9543 transitions. [2025-02-05 20:09:08,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:09:08,648 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.111111111111114) internal successors, (298), 9 states have internal predecessors, (298), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 305 [2025-02-05 20:09:08,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:08,651 INFO L225 Difference]: With dead ends: 6526 [2025-02-05 20:09:08,652 INFO L226 Difference]: Without dead ends: 4421 [2025-02-05 20:09:08,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:09:08,654 INFO L435 NwaCegarLoop]: 1101 mSDtfsCounter, 1840 mSDsluCounter, 6076 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1840 SdHoareTripleChecker+Valid, 7177 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:08,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1840 Valid, 7177 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:09:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4421 states. [2025-02-05 20:09:08,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4421 to 3698. [2025-02-05 20:09:08,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3698 states, 3672 states have (on average 1.4501633986928104) internal successors, (5325), 3672 states have internal predecessors, (5325), 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-02-05 20:09:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5373 transitions. [2025-02-05 20:09:08,685 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5373 transitions. Word has length 305 [2025-02-05 20:09:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:08,686 INFO L471 AbstractCegarLoop]: Abstraction has 3698 states and 5373 transitions. [2025-02-05 20:09:08,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.111111111111114) internal successors, (298), 9 states have internal predecessors, (298), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:08,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5373 transitions. [2025-02-05 20:09:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-02-05 20:09:08,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:08,690 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:08,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 20:09:08,690 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:08,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:08,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1672025332, now seen corresponding path program 1 times [2025-02-05 20:09:08,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:08,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915755971] [2025-02-05 20:09:08,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:08,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:08,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-05 20:09:08,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-05 20:09:08,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:08,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:09,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:09,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:09,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915755971] [2025-02-05 20:09:09,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915755971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:09,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:09,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:09:09,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073774086] [2025-02-05 20:09:09,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:09,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:09:09,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:09,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:09:09,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:09,220 INFO L87 Difference]: Start difference. First operand 3698 states and 5373 transitions. Second operand has 6 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 states have internal predecessors, (298), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:09,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:09,735 INFO L93 Difference]: Finished difference Result 6366 states and 9261 transitions. [2025-02-05 20:09:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:09:09,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 states have internal predecessors, (298), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 305 [2025-02-05 20:09:09,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:09,739 INFO L225 Difference]: With dead ends: 6366 [2025-02-05 20:09:09,739 INFO L226 Difference]: Without dead ends: 4678 [2025-02-05 20:09:09,741 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-02-05 20:09:09,742 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 1770 mSDsluCounter, 2745 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1772 SdHoareTripleChecker+Valid, 3685 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:09,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1772 Valid, 3685 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:09:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4678 states. [2025-02-05 20:09:09,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4678 to 4632. [2025-02-05 20:09:09,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4598 states have (on average 1.448455850369726) internal successors, (6660), 4598 states have internal predecessors, (6660), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 20:09:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 6724 transitions. [2025-02-05 20:09:09,774 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 6724 transitions. Word has length 305 [2025-02-05 20:09:09,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:09,775 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 6724 transitions. [2025-02-05 20:09:09,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 states have internal predecessors, (298), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 6724 transitions. [2025-02-05 20:09:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-02-05 20:09:09,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:09,779 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:09,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 20:09:09,779 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:09,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:09,779 INFO L85 PathProgramCache]: Analyzing trace with hash -720372868, now seen corresponding path program 1 times [2025-02-05 20:09:09,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:09,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939134208] [2025-02-05 20:09:09,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:09,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:09,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-05 20:09:09,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-05 20:09:09,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:09,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:10,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:10,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:10,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939134208] [2025-02-05 20:09:10,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939134208] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:10,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:10,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:09:10,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040206672] [2025-02-05 20:09:10,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:10,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:09:10,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:10,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:09:10,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:10,176 INFO L87 Difference]: Start difference. First operand 4632 states and 6724 transitions. Second operand has 6 states, 6 states have (on average 49.833333333333336) internal successors, (299), 6 states have internal predecessors, (299), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:10,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:10,695 INFO L93 Difference]: Finished difference Result 6734 states and 9813 transitions. [2025-02-05 20:09:10,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:09:10,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.833333333333336) internal successors, (299), 6 states have internal predecessors, (299), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 306 [2025-02-05 20:09:10,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:10,705 INFO L225 Difference]: With dead ends: 6734 [2025-02-05 20:09:10,705 INFO L226 Difference]: Without dead ends: 5046 [2025-02-05 20:09:10,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:09:10,707 INFO L435 NwaCegarLoop]: 973 mSDtfsCounter, 615 mSDsluCounter, 3887 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 4860 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:10,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 4860 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:09:10,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5046 states. [2025-02-05 20:09:10,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5046 to 4680. [2025-02-05 20:09:10,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4680 states, 4646 states have (on average 1.4485578992681878) internal successors, (6730), 4646 states have internal predecessors, (6730), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 20:09:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 6794 transitions. [2025-02-05 20:09:10,764 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 6794 transitions. Word has length 306 [2025-02-05 20:09:10,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:10,764 INFO L471 AbstractCegarLoop]: Abstraction has 4680 states and 6794 transitions. [2025-02-05 20:09:10,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.833333333333336) internal successors, (299), 6 states have internal predecessors, (299), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 6794 transitions. [2025-02-05 20:09:10,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-05 20:09:10,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:10,775 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:10,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 20:09:10,775 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:10,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:10,775 INFO L85 PathProgramCache]: Analyzing trace with hash -997263257, now seen corresponding path program 1 times [2025-02-05 20:09:10,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:10,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225945164] [2025-02-05 20:09:10,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:10,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:10,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 20:09:10,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 20:09:10,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:10,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:11,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:11,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225945164] [2025-02-05 20:09:11,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225945164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:11,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:11,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:09:11,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524832522] [2025-02-05 20:09:11,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:11,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:09:11,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:11,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:09:11,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:11,329 INFO L87 Difference]: Start difference. First operand 4680 states and 6794 transitions. Second operand has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:11,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:11,810 INFO L93 Difference]: Finished difference Result 6376 states and 9275 transitions. [2025-02-05 20:09:11,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:09:11,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 307 [2025-02-05 20:09:11,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:11,815 INFO L225 Difference]: With dead ends: 6376 [2025-02-05 20:09:11,815 INFO L226 Difference]: Without dead ends: 4688 [2025-02-05 20:09:11,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:11,818 INFO L435 NwaCegarLoop]: 994 mSDtfsCounter, 1011 mSDsluCounter, 2972 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 3966 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:11,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 3966 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:09:11,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4688 states. [2025-02-05 20:09:11,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4688 to 4684. [2025-02-05 20:09:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4684 states, 4650 states have (on average 1.4481720430107528) internal successors, (6734), 4650 states have internal predecessors, (6734), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 20:09:11,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 6798 transitions. [2025-02-05 20:09:11,873 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 6798 transitions. Word has length 307 [2025-02-05 20:09:11,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:11,873 INFO L471 AbstractCegarLoop]: Abstraction has 4684 states and 6798 transitions. [2025-02-05 20:09:11,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:11,873 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 6798 transitions. [2025-02-05 20:09:11,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-05 20:09:11,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:11,879 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:11,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 20:09:11,879 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:11,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:11,879 INFO L85 PathProgramCache]: Analyzing trace with hash 36278199, now seen corresponding path program 1 times [2025-02-05 20:09:11,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:11,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211436365] [2025-02-05 20:09:11,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:11,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:11,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 20:09:12,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 20:09:12,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:12,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:12,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:12,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211436365] [2025-02-05 20:09:12,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211436365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:12,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:12,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:09:12,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903145328] [2025-02-05 20:09:12,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:12,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:09:12,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:12,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:09:12,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:09:12,401 INFO L87 Difference]: Start difference. First operand 4684 states and 6798 transitions. Second operand has 7 states, 7 states have (on average 42.857142857142854) internal successors, (300), 7 states have internal predecessors, (300), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:13,328 INFO L93 Difference]: Finished difference Result 6796 states and 9895 transitions. [2025-02-05 20:09:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:09:13,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 42.857142857142854) internal successors, (300), 7 states have internal predecessors, (300), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 307 [2025-02-05 20:09:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:13,332 INFO L225 Difference]: With dead ends: 6796 [2025-02-05 20:09:13,332 INFO L226 Difference]: Without dead ends: 5094 [2025-02-05 20:09:13,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:09:13,334 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 1815 mSDsluCounter, 5423 mSDsCounter, 0 mSdLazyCounter, 2053 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1817 SdHoareTripleChecker+Valid, 6944 SdHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:13,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1817 Valid, 6944 Invalid, 2053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2053 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 20:09:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5094 states. [2025-02-05 20:09:13,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5094 to 4684. [2025-02-05 20:09:13,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4684 states, 4650 states have (on average 1.447741935483871) internal successors, (6732), 4650 states have internal predecessors, (6732), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 20:09:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 6796 transitions. [2025-02-05 20:09:13,367 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 6796 transitions. Word has length 307 [2025-02-05 20:09:13,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:13,367 INFO L471 AbstractCegarLoop]: Abstraction has 4684 states and 6796 transitions. [2025-02-05 20:09:13,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 42.857142857142854) internal successors, (300), 7 states have internal predecessors, (300), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:13,367 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 6796 transitions. [2025-02-05 20:09:13,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-05 20:09:13,370 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:13,370 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:13,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 20:09:13,371 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:13,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:13,371 INFO L85 PathProgramCache]: Analyzing trace with hash -357080625, now seen corresponding path program 1 times [2025-02-05 20:09:13,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:13,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233558279] [2025-02-05 20:09:13,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:13,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:13,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 20:09:13,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 20:09:13,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:13,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:14,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:14,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:14,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233558279] [2025-02-05 20:09:14,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233558279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:14,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:14,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 20:09:14,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938003508] [2025-02-05 20:09:14,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:14,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:09:14,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:14,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:09:14,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:09:14,185 INFO L87 Difference]: Start difference. First operand 4684 states and 6796 transitions. Second operand has 10 states, 10 states have (on average 30.0) internal successors, (300), 10 states have internal predecessors, (300), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:15,187 INFO L93 Difference]: Finished difference Result 7526 states and 10969 transitions. [2025-02-05 20:09:15,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:09:15,188 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 30.0) internal successors, (300), 10 states have internal predecessors, (300), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 307 [2025-02-05 20:09:15,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:15,191 INFO L225 Difference]: With dead ends: 7526 [2025-02-05 20:09:15,191 INFO L226 Difference]: Without dead ends: 4696 [2025-02-05 20:09:15,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:09:15,194 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 1464 mSDsluCounter, 5272 mSDsCounter, 0 mSdLazyCounter, 2091 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 6171 SdHoareTripleChecker+Invalid, 2093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:15,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 6171 Invalid, 2093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2091 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 20:09:15,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4696 states. [2025-02-05 20:09:15,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4696 to 4072. [2025-02-05 20:09:15,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4072 states, 4046 states have (on average 1.453287197231834) internal successors, (5880), 4046 states have internal predecessors, (5880), 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-02-05 20:09:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4072 states to 4072 states and 5928 transitions. [2025-02-05 20:09:15,224 INFO L78 Accepts]: Start accepts. Automaton has 4072 states and 5928 transitions. Word has length 307 [2025-02-05 20:09:15,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:15,224 INFO L471 AbstractCegarLoop]: Abstraction has 4072 states and 5928 transitions. [2025-02-05 20:09:15,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.0) internal successors, (300), 10 states have internal predecessors, (300), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 4072 states and 5928 transitions. [2025-02-05 20:09:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-02-05 20:09:15,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:15,228 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:15,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 20:09:15,228 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:15,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:15,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1693067142, now seen corresponding path program 1 times [2025-02-05 20:09:15,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:15,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630828043] [2025-02-05 20:09:15,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:15,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:15,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-05 20:09:15,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-05 20:09:15,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:15,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:15,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:15,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630828043] [2025-02-05 20:09:15,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630828043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:15,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:15,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:09:15,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330610529] [2025-02-05 20:09:15,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:15,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:09:15,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:15,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:09:15,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:15,629 INFO L87 Difference]: Start difference. First operand 4072 states and 5928 transitions. Second operand has 6 states, 6 states have (on average 50.166666666666664) internal successors, (301), 6 states have internal predecessors, (301), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:16,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:16,268 INFO L93 Difference]: Finished difference Result 7466 states and 10932 transitions. [2025-02-05 20:09:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:09:16,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 50.166666666666664) internal successors, (301), 6 states have internal predecessors, (301), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 308 [2025-02-05 20:09:16,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:16,273 INFO L225 Difference]: With dead ends: 7466 [2025-02-05 20:09:16,273 INFO L226 Difference]: Without dead ends: 5328 [2025-02-05 20:09:16,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:09:16,275 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 1220 mSDsluCounter, 3899 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 4870 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:16,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 4870 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:09:16,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5328 states. [2025-02-05 20:09:16,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5328 to 4136. [2025-02-05 20:09:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4136 states, 4110 states have (on average 1.4520681265206812) internal successors, (5968), 4110 states have internal predecessors, (5968), 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-02-05 20:09:16,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4136 states to 4136 states and 6016 transitions. [2025-02-05 20:09:16,310 INFO L78 Accepts]: Start accepts. Automaton has 4136 states and 6016 transitions. Word has length 308 [2025-02-05 20:09:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:16,310 INFO L471 AbstractCegarLoop]: Abstraction has 4136 states and 6016 transitions. [2025-02-05 20:09:16,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.166666666666664) internal successors, (301), 6 states have internal predecessors, (301), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:16,310 INFO L276 IsEmpty]: Start isEmpty. Operand 4136 states and 6016 transitions. [2025-02-05 20:09:16,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-02-05 20:09:16,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:16,313 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:16,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 20:09:16,313 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:16,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:16,313 INFO L85 PathProgramCache]: Analyzing trace with hash 590281330, now seen corresponding path program 1 times [2025-02-05 20:09:16,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:16,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956010073] [2025-02-05 20:09:16,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:16,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:16,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-05 20:09:16,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-05 20:09:16,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:16,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:16,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:16,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956010073] [2025-02-05 20:09:16,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956010073] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:16,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:16,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:09:16,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592557326] [2025-02-05 20:09:16,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:16,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:09:16,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:16,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:09:16,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:16,709 INFO L87 Difference]: Start difference. First operand 4136 states and 6016 transitions. Second operand has 6 states, 6 states have (on average 50.166666666666664) internal successors, (301), 6 states have internal predecessors, (301), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:17,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:17,088 INFO L93 Difference]: Finished difference Result 6525 states and 9526 transitions. [2025-02-05 20:09:17,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:09:17,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 50.166666666666664) internal successors, (301), 6 states have internal predecessors, (301), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 308 [2025-02-05 20:09:17,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:17,092 INFO L225 Difference]: With dead ends: 6525 [2025-02-05 20:09:17,092 INFO L226 Difference]: Without dead ends: 4168 [2025-02-05 20:09:17,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:17,094 INFO L435 NwaCegarLoop]: 995 mSDtfsCounter, 1089 mSDsluCounter, 2955 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 3950 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:17,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 3950 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:09:17,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2025-02-05 20:09:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 4152. [2025-02-05 20:09:17,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4152 states, 4126 states have (on average 1.450315075133301) internal successors, (5984), 4126 states have internal predecessors, (5984), 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-02-05 20:09:17,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 6032 transitions. [2025-02-05 20:09:17,136 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 6032 transitions. Word has length 308 [2025-02-05 20:09:17,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:17,136 INFO L471 AbstractCegarLoop]: Abstraction has 4152 states and 6032 transitions. [2025-02-05 20:09:17,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.166666666666664) internal successors, (301), 6 states have internal predecessors, (301), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:17,137 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 6032 transitions. [2025-02-05 20:09:17,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-02-05 20:09:17,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:17,141 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:17,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 20:09:17,141 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:17,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:17,141 INFO L85 PathProgramCache]: Analyzing trace with hash -916291090, now seen corresponding path program 1 times [2025-02-05 20:09:17,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:17,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712089417] [2025-02-05 20:09:17,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:17,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:17,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-05 20:09:17,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-05 20:09:17,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:17,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:17,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:17,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:17,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712089417] [2025-02-05 20:09:17,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712089417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:17,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:17,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:09:17,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562291959] [2025-02-05 20:09:17,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:17,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:09:17,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:17,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:09:17,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:09:17,801 INFO L87 Difference]: Start difference. First operand 4152 states and 6032 transitions. Second operand has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:18,545 INFO L93 Difference]: Finished difference Result 6145 states and 8960 transitions. [2025-02-05 20:09:18,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:09:18,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 308 [2025-02-05 20:09:18,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:18,549 INFO L225 Difference]: With dead ends: 6145 [2025-02-05 20:09:18,549 INFO L226 Difference]: Without dead ends: 4586 [2025-02-05 20:09:18,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:09:18,551 INFO L435 NwaCegarLoop]: 914 mSDtfsCounter, 2049 mSDsluCounter, 3608 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2051 SdHoareTripleChecker+Valid, 4522 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:18,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2051 Valid, 4522 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:09:18,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4586 states. [2025-02-05 20:09:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4586 to 4168. [2025-02-05 20:09:18,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4168 states, 4142 states have (on average 1.4495412844036697) internal successors, (6004), 4142 states have internal predecessors, (6004), 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-02-05 20:09:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 6052 transitions. [2025-02-05 20:09:18,582 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 6052 transitions. Word has length 308 [2025-02-05 20:09:18,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:18,582 INFO L471 AbstractCegarLoop]: Abstraction has 4168 states and 6052 transitions. [2025-02-05 20:09:18,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:18,582 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 6052 transitions. [2025-02-05 20:09:18,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-02-05 20:09:18,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:18,585 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:18,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 20:09:18,585 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:18,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:18,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1646791914, now seen corresponding path program 1 times [2025-02-05 20:09:18,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:18,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477031579] [2025-02-05 20:09:18,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:18,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:18,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-05 20:09:18,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-05 20:09:18,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:18,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:19,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:19,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:19,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477031579] [2025-02-05 20:09:19,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477031579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:19,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:19,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:09:19,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64819121] [2025-02-05 20:09:19,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:19,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:09:19,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:19,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:09:19,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:09:19,372 INFO L87 Difference]: Start difference. First operand 4168 states and 6052 transitions. Second operand has 9 states, 9 states have (on average 33.55555555555556) internal successors, (302), 9 states have internal predecessors, (302), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:20,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:20,237 INFO L93 Difference]: Finished difference Result 6141 states and 8950 transitions. [2025-02-05 20:09:20,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:09:20,237 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.55555555555556) internal successors, (302), 9 states have internal predecessors, (302), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 309 [2025-02-05 20:09:20,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:20,243 INFO L225 Difference]: With dead ends: 6141 [2025-02-05 20:09:20,244 INFO L226 Difference]: Without dead ends: 4546 [2025-02-05 20:09:20,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:09:20,246 INFO L435 NwaCegarLoop]: 964 mSDtfsCounter, 2110 mSDsluCounter, 5755 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2112 SdHoareTripleChecker+Valid, 6719 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:20,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2112 Valid, 6719 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:09:20,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2025-02-05 20:09:20,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 4172. [2025-02-05 20:09:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4172 states, 4146 states have (on average 1.4491075735648817) internal successors, (6008), 4146 states have internal predecessors, (6008), 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-02-05 20:09:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4172 states to 4172 states and 6056 transitions. [2025-02-05 20:09:20,277 INFO L78 Accepts]: Start accepts. Automaton has 4172 states and 6056 transitions. Word has length 309 [2025-02-05 20:09:20,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:20,277 INFO L471 AbstractCegarLoop]: Abstraction has 4172 states and 6056 transitions. [2025-02-05 20:09:20,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.55555555555556) internal successors, (302), 9 states have internal predecessors, (302), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 4172 states and 6056 transitions. [2025-02-05 20:09:20,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-02-05 20:09:20,281 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:20,281 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:20,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 20:09:20,281 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:20,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:20,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2026622895, now seen corresponding path program 1 times [2025-02-05 20:09:20,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:20,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270414405] [2025-02-05 20:09:20,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:20,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:20,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-05 20:09:20,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-05 20:09:20,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:20,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:20,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:20,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:20,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270414405] [2025-02-05 20:09:20,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270414405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:20,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:20,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:09:20,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375503600] [2025-02-05 20:09:20,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:20,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:09:20,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:20,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:09:20,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:09:20,774 INFO L87 Difference]: Start difference. First operand 4172 states and 6056 transitions. Second operand has 7 states, 7 states have (on average 43.142857142857146) internal successors, (302), 7 states have internal predecessors, (302), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:21,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:21,762 INFO L93 Difference]: Finished difference Result 6141 states and 8950 transitions. [2025-02-05 20:09:21,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:09:21,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.142857142857146) internal successors, (302), 7 states have internal predecessors, (302), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 309 [2025-02-05 20:09:21,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:21,765 INFO L225 Difference]: With dead ends: 6141 [2025-02-05 20:09:21,766 INFO L226 Difference]: Without dead ends: 4582 [2025-02-05 20:09:21,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:09:21,768 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 1799 mSDsluCounter, 5382 mSDsCounter, 0 mSdLazyCounter, 2080 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 6901 SdHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:21,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1801 Valid, 6901 Invalid, 2080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2080 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 20:09:21,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4582 states. [2025-02-05 20:09:21,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4582 to 4172. [2025-02-05 20:09:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4172 states, 4146 states have (on average 1.4491075735648817) internal successors, (6008), 4146 states have internal predecessors, (6008), 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-02-05 20:09:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4172 states to 4172 states and 6056 transitions. [2025-02-05 20:09:21,795 INFO L78 Accepts]: Start accepts. Automaton has 4172 states and 6056 transitions. Word has length 309 [2025-02-05 20:09:21,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:21,796 INFO L471 AbstractCegarLoop]: Abstraction has 4172 states and 6056 transitions. [2025-02-05 20:09:21,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.142857142857146) internal successors, (302), 7 states have internal predecessors, (302), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 4172 states and 6056 transitions. [2025-02-05 20:09:21,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-02-05 20:09:21,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:21,799 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:21,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 20:09:21,799 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:21,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:21,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1932164055, now seen corresponding path program 1 times [2025-02-05 20:09:21,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:21,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549904603] [2025-02-05 20:09:21,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:21,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:21,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-05 20:09:21,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-05 20:09:21,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:21,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:22,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:22,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549904603] [2025-02-05 20:09:22,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549904603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:22,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:22,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 20:09:22,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599742963] [2025-02-05 20:09:22,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:22,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 20:09:22,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:22,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 20:09:22,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:09:22,502 INFO L87 Difference]: Start difference. First operand 4172 states and 6056 transitions. Second operand has 11 states, 11 states have (on average 27.454545454545453) internal successors, (302), 11 states have internal predecessors, (302), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 20:09:24,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:24,081 INFO L93 Difference]: Finished difference Result 8572 states and 12456 transitions. [2025-02-05 20:09:24,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 20:09:24,081 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 27.454545454545453) internal successors, (302), 11 states have internal predecessors, (302), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 309 [2025-02-05 20:09:24,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:24,087 INFO L225 Difference]: With dead ends: 8572 [2025-02-05 20:09:24,087 INFO L226 Difference]: Without dead ends: 6979 [2025-02-05 20:09:24,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-02-05 20:09:24,092 INFO L435 NwaCegarLoop]: 1474 mSDtfsCounter, 2202 mSDsluCounter, 9537 mSDsCounter, 0 mSdLazyCounter, 3105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2205 SdHoareTripleChecker+Valid, 11011 SdHoareTripleChecker+Invalid, 3107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:24,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2205 Valid, 11011 Invalid, 3107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3105 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 20:09:24,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2025-02-05 20:09:24,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 5698. [2025-02-05 20:09:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5698 states, 5666 states have (on average 1.4472290857747971) internal successors, (8200), 5666 states have internal predecessors, (8200), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 20:09:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 8260 transitions. [2025-02-05 20:09:24,156 INFO L78 Accepts]: Start accepts. Automaton has 5698 states and 8260 transitions. Word has length 309 [2025-02-05 20:09:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:24,156 INFO L471 AbstractCegarLoop]: Abstraction has 5698 states and 8260 transitions. [2025-02-05 20:09:24,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.454545454545453) internal successors, (302), 11 states have internal predecessors, (302), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 20:09:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 5698 states and 8260 transitions. [2025-02-05 20:09:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-02-05 20:09:24,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:24,160 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:24,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 20:09:24,160 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:24,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:24,161 INFO L85 PathProgramCache]: Analyzing trace with hash -812329186, now seen corresponding path program 1 times [2025-02-05 20:09:24,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:24,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579263430] [2025-02-05 20:09:24,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:24,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:24,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-05 20:09:24,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-05 20:09:24,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:24,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:24,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:24,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:24,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579263430] [2025-02-05 20:09:24,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579263430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:24,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:24,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:09:24,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084061771] [2025-02-05 20:09:24,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:24,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:09:24,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:24,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:09:24,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:09:24,909 INFO L87 Difference]: Start difference. First operand 5698 states and 8260 transitions. Second operand has 7 states, 7 states have (on average 43.285714285714285) internal successors, (303), 7 states have internal predecessors, (303), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:25,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:25,510 INFO L93 Difference]: Finished difference Result 9591 states and 13986 transitions. [2025-02-05 20:09:25,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:09:25,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.285714285714285) internal successors, (303), 7 states have internal predecessors, (303), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 310 [2025-02-05 20:09:25,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:25,525 INFO L225 Difference]: With dead ends: 9591 [2025-02-05 20:09:25,525 INFO L226 Difference]: Without dead ends: 5698 [2025-02-05 20:09:25,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:09:25,530 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 2342 mSDsluCounter, 2633 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2342 SdHoareTripleChecker+Valid, 3541 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:25,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2342 Valid, 3541 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:09:25,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5698 states. [2025-02-05 20:09:25,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5698 to 5698. [2025-02-05 20:09:25,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5698 states, 5666 states have (on average 1.440875397105542) internal successors, (8164), 5666 states have internal predecessors, (8164), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 20:09:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 8224 transitions. [2025-02-05 20:09:25,571 INFO L78 Accepts]: Start accepts. Automaton has 5698 states and 8224 transitions. Word has length 310 [2025-02-05 20:09:25,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:25,571 INFO L471 AbstractCegarLoop]: Abstraction has 5698 states and 8224 transitions. [2025-02-05 20:09:25,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.285714285714285) internal successors, (303), 7 states have internal predecessors, (303), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:25,571 INFO L276 IsEmpty]: Start isEmpty. Operand 5698 states and 8224 transitions. [2025-02-05 20:09:25,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-02-05 20:09:25,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:25,575 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:25,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 20:09:25,575 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:25,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:25,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1157762324, now seen corresponding path program 1 times [2025-02-05 20:09:25,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:25,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548243104] [2025-02-05 20:09:25,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:25,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:25,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-02-05 20:09:25,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-02-05 20:09:25,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:25,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:26,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:26,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548243104] [2025-02-05 20:09:26,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548243104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:26,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:26,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 20:09:26,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275216584] [2025-02-05 20:09:26,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:26,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:09:26,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:26,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:09:26,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:09:26,285 INFO L87 Difference]: Start difference. First operand 5698 states and 8224 transitions. Second operand has 10 states, 10 states have (on average 30.4) internal successors, (304), 10 states have internal predecessors, (304), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:27,326 INFO L93 Difference]: Finished difference Result 9808 states and 14254 transitions. [2025-02-05 20:09:27,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:09:27,326 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 30.4) internal successors, (304), 10 states have internal predecessors, (304), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 311 [2025-02-05 20:09:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:27,333 INFO L225 Difference]: With dead ends: 9808 [2025-02-05 20:09:27,333 INFO L226 Difference]: Without dead ends: 7332 [2025-02-05 20:09:27,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:09:27,336 INFO L435 NwaCegarLoop]: 961 mSDtfsCounter, 3293 mSDsluCounter, 6688 mSDsCounter, 0 mSdLazyCounter, 1946 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3295 SdHoareTripleChecker+Valid, 7649 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:27,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3295 Valid, 7649 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1946 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 20:09:27,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7332 states. [2025-02-05 20:09:27,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7332 to 5710. [2025-02-05 20:09:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5710 states, 5678 states have (on average 1.4399436421275096) internal successors, (8176), 5678 states have internal predecessors, (8176), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 20:09:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5710 states to 5710 states and 8236 transitions. [2025-02-05 20:09:27,377 INFO L78 Accepts]: Start accepts. Automaton has 5710 states and 8236 transitions. Word has length 311 [2025-02-05 20:09:27,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:27,378 INFO L471 AbstractCegarLoop]: Abstraction has 5710 states and 8236 transitions. [2025-02-05 20:09:27,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.4) internal successors, (304), 10 states have internal predecessors, (304), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:27,378 INFO L276 IsEmpty]: Start isEmpty. Operand 5710 states and 8236 transitions. [2025-02-05 20:09:27,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-02-05 20:09:27,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:27,382 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:27,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-05 20:09:27,382 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:27,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:27,382 INFO L85 PathProgramCache]: Analyzing trace with hash -747106064, now seen corresponding path program 1 times [2025-02-05 20:09:27,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:27,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232589164] [2025-02-05 20:09:27,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:27,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:27,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-02-05 20:09:27,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-02-05 20:09:27,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:27,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:28,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:28,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:28,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232589164] [2025-02-05 20:09:28,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232589164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:28,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:28,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 20:09:28,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955330180] [2025-02-05 20:09:28,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:28,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 20:09:28,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:28,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 20:09:28,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:09:28,239 INFO L87 Difference]: Start difference. First operand 5710 states and 8236 transitions. Second operand has 12 states, 12 states have (on average 25.333333333333332) internal successors, (304), 12 states have internal predecessors, (304), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 20:09:29,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:29,949 INFO L93 Difference]: Finished difference Result 10647 states and 15431 transitions. [2025-02-05 20:09:29,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 20:09:29,950 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 25.333333333333332) internal successors, (304), 12 states have internal predecessors, (304), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 311 [2025-02-05 20:09:29,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:29,956 INFO L225 Difference]: With dead ends: 10647 [2025-02-05 20:09:29,956 INFO L226 Difference]: Without dead ends: 7958 [2025-02-05 20:09:29,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:09:29,959 INFO L435 NwaCegarLoop]: 1646 mSDtfsCounter, 2403 mSDsluCounter, 10870 mSDsCounter, 0 mSdLazyCounter, 3707 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2404 SdHoareTripleChecker+Valid, 12516 SdHoareTripleChecker+Invalid, 3709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:29,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2404 Valid, 12516 Invalid, 3709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3707 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 20:09:29,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7958 states. [2025-02-05 20:09:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7958 to 6068. [2025-02-05 20:09:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6068 states, 6032 states have (on average 1.4366710875331565) internal successors, (8666), 6032 states have internal predecessors, (8666), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 20:09:30,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6068 states to 6068 states and 8734 transitions. [2025-02-05 20:09:30,051 INFO L78 Accepts]: Start accepts. Automaton has 6068 states and 8734 transitions. Word has length 311 [2025-02-05 20:09:30,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:30,051 INFO L471 AbstractCegarLoop]: Abstraction has 6068 states and 8734 transitions. [2025-02-05 20:09:30,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 25.333333333333332) internal successors, (304), 12 states have internal predecessors, (304), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 20:09:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 6068 states and 8734 transitions. [2025-02-05 20:09:30,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-02-05 20:09:30,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:30,055 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:30,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-05 20:09:30,055 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:30,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:30,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1213181769, now seen corresponding path program 1 times [2025-02-05 20:09:30,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:30,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012605729] [2025-02-05 20:09:30,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:30,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:30,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-02-05 20:09:30,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-02-05 20:09:30,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:30,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:30,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:30,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:30,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012605729] [2025-02-05 20:09:30,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012605729] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:30,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:30,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:09:30,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925830475] [2025-02-05 20:09:30,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:30,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:09:30,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:30,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:09:30,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:09:30,618 INFO L87 Difference]: Start difference. First operand 6068 states and 8734 transitions. Second operand has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:31,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:31,280 INFO L93 Difference]: Finished difference Result 8222 states and 11881 transitions. [2025-02-05 20:09:31,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:09:31,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 311 [2025-02-05 20:09:31,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:31,287 INFO L225 Difference]: With dead ends: 8222 [2025-02-05 20:09:31,287 INFO L226 Difference]: Without dead ends: 6486 [2025-02-05 20:09:31,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:09:31,289 INFO L435 NwaCegarLoop]: 913 mSDtfsCounter, 2033 mSDsluCounter, 3608 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2035 SdHoareTripleChecker+Valid, 4521 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:31,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2035 Valid, 4521 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:09:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6486 states. [2025-02-05 20:09:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6486 to 5299. [2025-02-05 20:09:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 5266 states have (on average 1.4379035320926699) internal successors, (7572), 5266 states have internal predecessors, (7572), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 20:09:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 7634 transitions. [2025-02-05 20:09:31,340 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 7634 transitions. Word has length 311 [2025-02-05 20:09:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:31,340 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 7634 transitions. [2025-02-05 20:09:31,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 7634 transitions. [2025-02-05 20:09:31,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-02-05 20:09:31,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:31,344 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:31,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-05 20:09:31,344 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:31,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:31,344 INFO L85 PathProgramCache]: Analyzing trace with hash -316633413, now seen corresponding path program 1 times [2025-02-05 20:09:31,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:31,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859747900] [2025-02-05 20:09:31,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:31,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:31,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-05 20:09:31,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-05 20:09:31,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:31,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:31,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:31,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859747900] [2025-02-05 20:09:31,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859747900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:31,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:31,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:09:31,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194839637] [2025-02-05 20:09:31,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:31,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:09:31,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:31,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:09:31,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:09:31,687 INFO L87 Difference]: Start difference. First operand 5299 states and 7634 transitions. Second operand has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:32,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:32,006 INFO L93 Difference]: Finished difference Result 8953 states and 12971 transitions. [2025-02-05 20:09:32,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:09:32,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 312 [2025-02-05 20:09:32,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:32,012 INFO L225 Difference]: With dead ends: 8953 [2025-02-05 20:09:32,012 INFO L226 Difference]: Without dead ends: 5419 [2025-02-05 20:09:32,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:09:32,017 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 2 mSDsluCounter, 2988 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3989 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:32,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3989 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:09:32,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5419 states. [2025-02-05 20:09:32,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5419 to 5389. [2025-02-05 20:09:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5389 states, 5356 states have (on average 1.4342793129200897) internal successors, (7682), 5356 states have internal predecessors, (7682), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 20:09:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5389 states to 5389 states and 7744 transitions. [2025-02-05 20:09:32,062 INFO L78 Accepts]: Start accepts. Automaton has 5389 states and 7744 transitions. Word has length 312 [2025-02-05 20:09:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:32,063 INFO L471 AbstractCegarLoop]: Abstraction has 5389 states and 7744 transitions. [2025-02-05 20:09:32,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 5389 states and 7744 transitions. [2025-02-05 20:09:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-02-05 20:09:32,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:32,067 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:32,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-05 20:09:32,067 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:32,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:32,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1432366589, now seen corresponding path program 1 times [2025-02-05 20:09:32,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:32,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879152924] [2025-02-05 20:09:32,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:32,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:32,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-05 20:09:32,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-05 20:09:32,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:32,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:32,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:32,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879152924] [2025-02-05 20:09:32,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879152924] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:32,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:32,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:09:32,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459016836] [2025-02-05 20:09:32,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:32,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:09:32,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:32,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:09:32,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:32,483 INFO L87 Difference]: Start difference. First operand 5389 states and 7744 transitions. Second operand has 6 states, 6 states have (on average 50.833333333333336) internal successors, (305), 6 states have internal predecessors, (305), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:33,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:33,060 INFO L93 Difference]: Finished difference Result 9300 states and 13469 transitions. [2025-02-05 20:09:33,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:09:33,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 50.833333333333336) internal successors, (305), 6 states have internal predecessors, (305), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 312 [2025-02-05 20:09:33,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:33,068 INFO L225 Difference]: With dead ends: 9300 [2025-02-05 20:09:33,068 INFO L226 Difference]: Without dead ends: 6799 [2025-02-05 20:09:33,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:09:33,072 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 1212 mSDsluCounter, 3895 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 4865 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:33,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 4865 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:09:33,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6799 states. [2025-02-05 20:09:33,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6799 to 5469. [2025-02-05 20:09:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5469 states, 5436 states have (on average 1.4334069168506254) internal successors, (7792), 5436 states have internal predecessors, (7792), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 20:09:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5469 states to 5469 states and 7854 transitions. [2025-02-05 20:09:33,125 INFO L78 Accepts]: Start accepts. Automaton has 5469 states and 7854 transitions. Word has length 312 [2025-02-05 20:09:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:33,125 INFO L471 AbstractCegarLoop]: Abstraction has 5469 states and 7854 transitions. [2025-02-05 20:09:33,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.833333333333336) internal successors, (305), 6 states have internal predecessors, (305), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 5469 states and 7854 transitions. [2025-02-05 20:09:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-02-05 20:09:33,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:33,129 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:33,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-05 20:09:33,129 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:33,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:33,130 INFO L85 PathProgramCache]: Analyzing trace with hash 427753379, now seen corresponding path program 1 times [2025-02-05 20:09:33,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:33,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407956253] [2025-02-05 20:09:33,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:33,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:33,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-05 20:09:33,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-05 20:09:33,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:33,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:33,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:33,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407956253] [2025-02-05 20:09:33,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407956253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:33,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:33,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:09:33,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650478275] [2025-02-05 20:09:33,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:33,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:09:33,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:33,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:09:33,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:09:33,905 INFO L87 Difference]: Start difference. First operand 5469 states and 7854 transitions. Second operand has 7 states, 7 states have (on average 43.57142857142857) internal successors, (305), 7 states have internal predecessors, (305), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:34,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:34,429 INFO L93 Difference]: Finished difference Result 8989 states and 13001 transitions. [2025-02-05 20:09:34,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:09:34,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.57142857142857) internal successors, (305), 7 states have internal predecessors, (305), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 312 [2025-02-05 20:09:34,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:34,433 INFO L225 Difference]: With dead ends: 8989 [2025-02-05 20:09:34,434 INFO L226 Difference]: Without dead ends: 5469 [2025-02-05 20:09:34,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:09:34,436 INFO L435 NwaCegarLoop]: 907 mSDtfsCounter, 1437 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 3550 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:34,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1437 Valid, 3550 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:09:34,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5469 states. [2025-02-05 20:09:34,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5469 to 5469. [2025-02-05 20:09:34,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5469 states, 5436 states have (on average 1.4260485651214128) internal successors, (7752), 5436 states have internal predecessors, (7752), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 20:09:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5469 states to 5469 states and 7814 transitions. [2025-02-05 20:09:34,472 INFO L78 Accepts]: Start accepts. Automaton has 5469 states and 7814 transitions. Word has length 312 [2025-02-05 20:09:34,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:34,473 INFO L471 AbstractCegarLoop]: Abstraction has 5469 states and 7814 transitions. [2025-02-05 20:09:34,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.57142857142857) internal successors, (305), 7 states have internal predecessors, (305), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:34,473 INFO L276 IsEmpty]: Start isEmpty. Operand 5469 states and 7814 transitions. [2025-02-05 20:09:34,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-02-05 20:09:34,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:34,476 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:34,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-05 20:09:34,476 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:34,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:34,477 INFO L85 PathProgramCache]: Analyzing trace with hash -230404343, now seen corresponding path program 1 times [2025-02-05 20:09:34,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:34,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283441410] [2025-02-05 20:09:34,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:34,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:34,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-02-05 20:09:34,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-02-05 20:09:34,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:34,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:34,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:34,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283441410] [2025-02-05 20:09:34,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283441410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:34,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:34,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:09:34,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141738554] [2025-02-05 20:09:34,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:34,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:09:34,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:34,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:09:34,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:34,841 INFO L87 Difference]: Start difference. First operand 5469 states and 7814 transitions. Second operand has 6 states, 6 states have (on average 51.0) internal successors, (306), 6 states have internal predecessors, (306), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:35,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:35,472 INFO L93 Difference]: Finished difference Result 9252 states and 13337 transitions. [2025-02-05 20:09:35,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:09:35,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.0) internal successors, (306), 6 states have internal predecessors, (306), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 313 [2025-02-05 20:09:35,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:35,481 INFO L225 Difference]: With dead ends: 9252 [2025-02-05 20:09:35,481 INFO L226 Difference]: Without dead ends: 6799 [2025-02-05 20:09:35,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:09:35,486 INFO L435 NwaCegarLoop]: 969 mSDtfsCounter, 1205 mSDsluCounter, 3891 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 4860 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:35,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 4860 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:09:35,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6799 states. [2025-02-05 20:09:35,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6799 to 5549. [2025-02-05 20:09:35,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5549 states, 5516 states have (on average 1.4253081943437274) internal successors, (7862), 5516 states have internal predecessors, (7862), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 20:09:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5549 states to 5549 states and 7924 transitions. [2025-02-05 20:09:35,562 INFO L78 Accepts]: Start accepts. Automaton has 5549 states and 7924 transitions. Word has length 313 [2025-02-05 20:09:35,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:35,563 INFO L471 AbstractCegarLoop]: Abstraction has 5549 states and 7924 transitions. [2025-02-05 20:09:35,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.0) internal successors, (306), 6 states have internal predecessors, (306), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:35,563 INFO L276 IsEmpty]: Start isEmpty. Operand 5549 states and 7924 transitions. [2025-02-05 20:09:35,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-02-05 20:09:35,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:35,568 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:35,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-05 20:09:35,568 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:35,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:35,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1665193613, now seen corresponding path program 1 times [2025-02-05 20:09:35,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:35,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897047937] [2025-02-05 20:09:35,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:35,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:35,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-02-05 20:09:35,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-02-05 20:09:35,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:35,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:36,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:36,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:36,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897047937] [2025-02-05 20:09:36,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897047937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:36,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:36,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:09:36,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960794644] [2025-02-05 20:09:36,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:36,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:09:36,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:36,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:09:36,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:09:36,245 INFO L87 Difference]: Start difference. First operand 5549 states and 7924 transitions. Second operand has 7 states, 7 states have (on average 43.714285714285715) internal successors, (306), 7 states have internal predecessors, (306), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:36,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:36,806 INFO L93 Difference]: Finished difference Result 8957 states and 12893 transitions. [2025-02-05 20:09:36,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:09:36,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.714285714285715) internal successors, (306), 7 states have internal predecessors, (306), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 313 [2025-02-05 20:09:36,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:36,814 INFO L225 Difference]: With dead ends: 8957 [2025-02-05 20:09:36,814 INFO L226 Difference]: Without dead ends: 5549 [2025-02-05 20:09:36,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:09:36,819 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 2318 mSDsluCounter, 2617 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2318 SdHoareTripleChecker+Valid, 3523 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:36,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2318 Valid, 3523 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:09:36,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5549 states. [2025-02-05 20:09:36,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5549 to 5549. [2025-02-05 20:09:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5549 states, 5516 states have (on average 1.4216823785351704) internal successors, (7842), 5516 states have internal predecessors, (7842), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 20:09:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5549 states to 5549 states and 7904 transitions. [2025-02-05 20:09:36,885 INFO L78 Accepts]: Start accepts. Automaton has 5549 states and 7904 transitions. Word has length 313 [2025-02-05 20:09:36,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:36,885 INFO L471 AbstractCegarLoop]: Abstraction has 5549 states and 7904 transitions. [2025-02-05 20:09:36,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.714285714285715) internal successors, (306), 7 states have internal predecessors, (306), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 5549 states and 7904 transitions. [2025-02-05 20:09:36,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-02-05 20:09:36,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:36,891 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:36,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-05 20:09:36,891 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:36,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:36,892 INFO L85 PathProgramCache]: Analyzing trace with hash -874579059, now seen corresponding path program 1 times [2025-02-05 20:09:36,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:36,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382173886] [2025-02-05 20:09:36,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:36,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:36,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-02-05 20:09:37,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-02-05 20:09:37,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:37,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:37,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:37,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382173886] [2025-02-05 20:09:37,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382173886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:37,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:37,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:09:37,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198574441] [2025-02-05 20:09:37,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:37,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:09:37,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:37,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:09:37,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:37,473 INFO L87 Difference]: Start difference. First operand 5549 states and 7904 transitions. Second operand has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:38,092 INFO L93 Difference]: Finished difference Result 9204 states and 13229 transitions. [2025-02-05 20:09:38,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:09:38,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 314 [2025-02-05 20:09:38,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:38,101 INFO L225 Difference]: With dead ends: 9204 [2025-02-05 20:09:38,101 INFO L226 Difference]: Without dead ends: 6799 [2025-02-05 20:09:38,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:09:38,106 INFO L435 NwaCegarLoop]: 968 mSDtfsCounter, 1198 mSDsluCounter, 3887 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 4855 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:38,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 4855 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:09:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6799 states. [2025-02-05 20:09:38,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6799 to 5629. [2025-02-05 20:09:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5629 states, 5596 states have (on average 1.4210150107219441) internal successors, (7952), 5596 states have internal predecessors, (7952), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 20:09:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5629 states to 5629 states and 8014 transitions. [2025-02-05 20:09:38,165 INFO L78 Accepts]: Start accepts. Automaton has 5629 states and 8014 transitions. Word has length 314 [2025-02-05 20:09:38,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:38,165 INFO L471 AbstractCegarLoop]: Abstraction has 5629 states and 8014 transitions. [2025-02-05 20:09:38,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:38,166 INFO L276 IsEmpty]: Start isEmpty. Operand 5629 states and 8014 transitions. [2025-02-05 20:09:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-02-05 20:09:38,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:38,170 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:38,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-05 20:09:38,170 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:38,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:38,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1996896267, now seen corresponding path program 1 times [2025-02-05 20:09:38,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:38,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013185256] [2025-02-05 20:09:38,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:38,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:38,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-02-05 20:09:38,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-02-05 20:09:38,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:38,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:38,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:38,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013185256] [2025-02-05 20:09:38,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013185256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:38,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:38,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:09:38,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570974603] [2025-02-05 20:09:38,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:38,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:09:38,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:38,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:09:38,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:09:38,754 INFO L87 Difference]: Start difference. First operand 5629 states and 8014 transitions. Second operand has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:39,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:39,328 INFO L93 Difference]: Finished difference Result 8684 states and 12411 transitions. [2025-02-05 20:09:39,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:09:39,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 314 [2025-02-05 20:09:39,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:39,335 INFO L225 Difference]: With dead ends: 8684 [2025-02-05 20:09:39,335 INFO L226 Difference]: Without dead ends: 6882 [2025-02-05 20:09:39,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:09:39,337 INFO L435 NwaCegarLoop]: 973 mSDtfsCounter, 599 mSDsluCounter, 3884 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 4857 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:39,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 4857 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:09:39,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6882 states. [2025-02-05 20:09:39,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6882 to 6532. [2025-02-05 20:09:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6532 states, 6496 states have (on average 1.4190270935960592) internal successors, (9218), 6496 states have internal predecessors, (9218), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 20:09:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 9286 transitions. [2025-02-05 20:09:39,379 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 9286 transitions. Word has length 314 [2025-02-05 20:09:39,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:39,380 INFO L471 AbstractCegarLoop]: Abstraction has 6532 states and 9286 transitions. [2025-02-05 20:09:39,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:39,380 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 9286 transitions. [2025-02-05 20:09:39,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-02-05 20:09:39,383 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:39,384 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:39,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-05 20:09:39,384 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:39,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:39,384 INFO L85 PathProgramCache]: Analyzing trace with hash -100713512, now seen corresponding path program 1 times [2025-02-05 20:09:39,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:39,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188143220] [2025-02-05 20:09:39,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:39,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:39,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-05 20:09:39,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-05 20:09:39,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:39,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:39,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:39,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188143220] [2025-02-05 20:09:39,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188143220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:39,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:39,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:09:39,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253713076] [2025-02-05 20:09:39,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:39,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:09:39,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:39,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:09:39,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:09:39,668 INFO L87 Difference]: Start difference. First operand 6532 states and 9286 transitions. Second operand has 5 states, 5 states have (on average 61.6) internal successors, (308), 5 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:40,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:40,047 INFO L93 Difference]: Finished difference Result 8346 states and 11901 transitions. [2025-02-05 20:09:40,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:09:40,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.6) internal successors, (308), 5 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 315 [2025-02-05 20:09:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:40,055 INFO L225 Difference]: With dead ends: 8346 [2025-02-05 20:09:40,055 INFO L226 Difference]: Without dead ends: 6544 [2025-02-05 20:09:40,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:09:40,057 INFO L435 NwaCegarLoop]: 995 mSDtfsCounter, 2 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3970 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:40,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3970 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:09:40,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6544 states. [2025-02-05 20:09:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6544 to 6542. [2025-02-05 20:09:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6542 states, 6506 states have (on average 1.4186904395942208) internal successors, (9230), 6506 states have internal predecessors, (9230), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 20:09:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 9298 transitions. [2025-02-05 20:09:40,105 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 9298 transitions. Word has length 315 [2025-02-05 20:09:40,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:40,105 INFO L471 AbstractCegarLoop]: Abstraction has 6542 states and 9298 transitions. [2025-02-05 20:09:40,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.6) internal successors, (308), 5 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 9298 transitions. [2025-02-05 20:09:40,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-02-05 20:09:40,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:40,113 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:40,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-05 20:09:40,114 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:40,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:40,114 INFO L85 PathProgramCache]: Analyzing trace with hash -985683489, now seen corresponding path program 1 times [2025-02-05 20:09:40,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:40,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077510969] [2025-02-05 20:09:40,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:40,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:40,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-05 20:09:40,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-05 20:09:40,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:40,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:40,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:40,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077510969] [2025-02-05 20:09:40,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077510969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:40,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:40,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:09:40,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020747509] [2025-02-05 20:09:40,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:40,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:09:40,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:40,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:09:40,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:09:40,404 INFO L87 Difference]: Start difference. First operand 6542 states and 9298 transitions. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:40,662 INFO L93 Difference]: Finished difference Result 8384 states and 11949 transitions. [2025-02-05 20:09:40,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:09:40,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 315 [2025-02-05 20:09:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:40,668 INFO L225 Difference]: With dead ends: 8384 [2025-02-05 20:09:40,668 INFO L226 Difference]: Without dead ends: 6558 [2025-02-05 20:09:40,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-02-05 20:09:40,671 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 0 mSDsluCounter, 1988 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2985 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:40,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2985 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:09:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6558 states. [2025-02-05 20:09:40,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6558 to 6558. [2025-02-05 20:09:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6558 states, 6522 states have (on average 1.417969947868752) internal successors, (9248), 6522 states have internal predecessors, (9248), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 20:09:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6558 states to 6558 states and 9316 transitions. [2025-02-05 20:09:40,724 INFO L78 Accepts]: Start accepts. Automaton has 6558 states and 9316 transitions. Word has length 315 [2025-02-05 20:09:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:40,725 INFO L471 AbstractCegarLoop]: Abstraction has 6558 states and 9316 transitions. [2025-02-05 20:09:40,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 6558 states and 9316 transitions. [2025-02-05 20:09:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-02-05 20:09:40,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:40,729 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:40,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-05 20:09:40,729 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:40,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:40,730 INFO L85 PathProgramCache]: Analyzing trace with hash 109255659, now seen corresponding path program 1 times [2025-02-05 20:09:40,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:40,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660541572] [2025-02-05 20:09:40,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:40,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:40,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-05 20:09:40,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-05 20:09:40,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:40,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:41,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:41,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:41,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660541572] [2025-02-05 20:09:41,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660541572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:41,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:41,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:09:41,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371551789] [2025-02-05 20:09:41,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:41,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:09:41,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:41,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:09:41,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:09:41,271 INFO L87 Difference]: Start difference. First operand 6558 states and 9316 transitions. Second operand has 7 states, 7 states have (on average 44.0) internal successors, (308), 7 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:42,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:42,227 INFO L93 Difference]: Finished difference Result 8798 states and 12559 transitions. [2025-02-05 20:09:42,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:09:42,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 44.0) internal successors, (308), 7 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 315 [2025-02-05 20:09:42,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:42,234 INFO L225 Difference]: With dead ends: 8798 [2025-02-05 20:09:42,234 INFO L226 Difference]: Without dead ends: 6984 [2025-02-05 20:09:42,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:09:42,237 INFO L435 NwaCegarLoop]: 1512 mSDtfsCounter, 1782 mSDsluCounter, 5407 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1784 SdHoareTripleChecker+Valid, 6919 SdHoareTripleChecker+Invalid, 2055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:42,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1784 Valid, 6919 Invalid, 2055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2055 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 20:09:42,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6984 states. [2025-02-05 20:09:42,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6984 to 6558. [2025-02-05 20:09:42,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6558 states, 6522 states have (on average 1.417969947868752) internal successors, (9248), 6522 states have internal predecessors, (9248), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 20:09:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6558 states to 6558 states and 9316 transitions. [2025-02-05 20:09:42,406 INFO L78 Accepts]: Start accepts. Automaton has 6558 states and 9316 transitions. Word has length 315 [2025-02-05 20:09:42,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:42,406 INFO L471 AbstractCegarLoop]: Abstraction has 6558 states and 9316 transitions. [2025-02-05 20:09:42,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 44.0) internal successors, (308), 7 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:42,406 INFO L276 IsEmpty]: Start isEmpty. Operand 6558 states and 9316 transitions. [2025-02-05 20:09:42,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-02-05 20:09:42,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:42,411 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:42,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-02-05 20:09:42,412 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:42,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:42,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1196328978, now seen corresponding path program 1 times [2025-02-05 20:09:42,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:42,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386214857] [2025-02-05 20:09:42,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:42,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:42,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-05 20:09:42,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-05 20:09:42,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:42,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:09:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:09:42,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:09:42,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386214857] [2025-02-05 20:09:42,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386214857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:09:42,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:09:42,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:09:42,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306762474] [2025-02-05 20:09:42,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:09:42,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:09:42,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:42,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:09:42,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:09:42,962 INFO L87 Difference]: Start difference. First operand 6558 states and 9316 transitions. Second operand has 7 states, 7 states have (on average 44.0) internal successors, (308), 7 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:43,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:43,706 INFO L93 Difference]: Finished difference Result 8750 states and 12493 transitions. [2025-02-05 20:09:43,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:09:43,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 44.0) internal successors, (308), 7 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 315 [2025-02-05 20:09:43,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:43,712 INFO L225 Difference]: With dead ends: 8750 [2025-02-05 20:09:43,712 INFO L226 Difference]: Without dead ends: 6936 [2025-02-05 20:09:43,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:09:43,714 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 2300 mSDsluCounter, 3600 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2302 SdHoareTripleChecker+Valid, 4511 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:43,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2302 Valid, 4511 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:09:43,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6936 states. [2025-02-05 20:09:43,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6936 to 5671. [2025-02-05 20:09:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5671 states, 5638 states have (on average 1.4196523589925505) internal successors, (8004), 5638 states have internal predecessors, (8004), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 20:09:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5671 states to 5671 states and 8066 transitions. [2025-02-05 20:09:43,755 INFO L78 Accepts]: Start accepts. Automaton has 5671 states and 8066 transitions. Word has length 315 [2025-02-05 20:09:43,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:43,756 INFO L471 AbstractCegarLoop]: Abstraction has 5671 states and 8066 transitions. [2025-02-05 20:09:43,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 44.0) internal successors, (308), 7 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 20:09:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 5671 states and 8066 transitions. [2025-02-05 20:09:43,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-02-05 20:09:43,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:43,759 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:43,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-02-05 20:09:43,759 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:09:43,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:09:43,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1233079417, now seen corresponding path program 1 times [2025-02-05 20:09:43,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:09:43,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139568076] [2025-02-05 20:09:43,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:09:43,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:09:43,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-02-05 20:09:43,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-02-05 20:09:43,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:09:43,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat