./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d32_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d32_e0.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9138a2614bedb023e2047cd39c42b34c38da629619813e3b818f3e1fdd02af0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:37:30,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:37:30,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 21:37:30,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:37:30,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:37:30,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:37:30,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:37:30,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:37:30,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:37:30,403 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:37:30,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:37:30,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:37:30,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:37:30,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:37:30,404 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:37:30,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:37:30,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:37:30,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 21:37:30,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:37:30,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:37:30,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:37:30,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:37:30,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:37:30,405 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:37:30,405 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:37:30,405 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:37:30,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:37:30,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:37:30,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:37:30,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:37:30,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:37:30,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:37:30,406 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:37:30,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:37:30,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 21:37:30,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 21:37:30,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:37:30,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:37:30,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:37:30,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:37:30,407 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9138a2614bedb023e2047cd39c42b34c38da629619813e3b818f3e1fdd02af0f [2025-03-16 21:37:30,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:37:30,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:37:30,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:37:30,667 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:37:30,667 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:37:30,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d32_e0.c [2025-03-16 21:37:31,852 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ae566d9/a0f6ffeede084d45b13187bbc61c797b/FLAG3512d4f02 [2025-03-16 21:37:32,122 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:37:32,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d32_e0.c [2025-03-16 21:37:32,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ae566d9/a0f6ffeede084d45b13187bbc61c797b/FLAG3512d4f02 [2025-03-16 21:37:32,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ae566d9/a0f6ffeede084d45b13187bbc61c797b [2025-03-16 21:37:32,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:37:32,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:37:32,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:37:32,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:37:32,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:37:32,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:37:32" (1/1) ... [2025-03-16 21:37:32,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a283b78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:37:32, skipping insertion in model container [2025-03-16 21:37:32,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:37:32" (1/1) ... [2025-03-16 21:37:32,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:37:32,574 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d32_e0.c[1280,1293] [2025-03-16 21:37:32,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:37:32,770 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:37:32,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d32_e0.c[1280,1293] [2025-03-16 21:37:32,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:37:32,884 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:37:32,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:37:32 WrapperNode [2025-03-16 21:37:32,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:37:32,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:37:32,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:37:32,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:37:32,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:37:32" (1/1) ... [2025-03-16 21:37:32,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:37:32" (1/1) ... [2025-03-16 21:37:33,128 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3162 [2025-03-16 21:37:33,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:37:33,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:37:33,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:37:33,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:37:33,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:37:32" (1/1) ... [2025-03-16 21:37:33,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:37:32" (1/1) ... [2025-03-16 21:37:33,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:37:32" (1/1) ... [2025-03-16 21:37:33,290 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 21:37:33,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:37:32" (1/1) ... [2025-03-16 21:37:33,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:37:32" (1/1) ... [2025-03-16 21:37:33,341 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:37:32" (1/1) ... [2025-03-16 21:37:33,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:37:32" (1/1) ... [2025-03-16 21:37:33,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:37:32" (1/1) ... [2025-03-16 21:37:33,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:37:32" (1/1) ... [2025-03-16 21:37:33,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:37:33,404 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:37:33,404 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:37:33,404 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:37:33,405 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:37:32" (1/1) ... [2025-03-16 21:37:33,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:37:33,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:37:33,454 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 21:37:33,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 21:37:33,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:37:33,471 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 21:37:33,471 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 21:37:33,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 21:37:33,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:37:33,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:37:33,699 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:37:33,700 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:37:36,103 INFO L? ?]: Removed 1762 outVars from TransFormulas that were not future-live. [2025-03-16 21:37:36,104 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:37:36,202 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:37:36,203 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:37:36,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:37:36 BoogieIcfgContainer [2025-03-16 21:37:36,203 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:37:36,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:37:36,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:37:36,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:37:36,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:37:32" (1/3) ... [2025-03-16 21:37:36,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab3c57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:37:36, skipping insertion in model container [2025-03-16 21:37:36,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:37:32" (2/3) ... [2025-03-16 21:37:36,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab3c57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:37:36, skipping insertion in model container [2025-03-16 21:37:36,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:37:36" (3/3) ... [2025-03-16 21:37:36,209 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w32_d32_e0.c [2025-03-16 21:37:36,225 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:37:36,226 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.circular_pointer_top_w32_d32_e0.c that has 2 procedures, 870 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:37:36,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:37:36,294 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;@771ab247, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:37:36,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:37:36,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 870 states, 864 states have (on average 1.4976851851851851) internal successors, (1294), 865 states have internal predecessors, (1294), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:36,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-16 21:37:36,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:36,321 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:36,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:36,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:36,326 INFO L85 PathProgramCache]: Analyzing trace with hash 452658525, now seen corresponding path program 1 times [2025-03-16 21:37:36,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:36,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712848216] [2025-03-16 21:37:36,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:36,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:36,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-16 21:37:36,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-16 21:37:36,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:36,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 21:37:36,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:36,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712848216] [2025-03-16 21:37:36,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712848216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:37:36,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260305002] [2025-03-16 21:37:36,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:36,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:37:36,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:37:36,768 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:37:36,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 21:37:37,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-16 21:37:37,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-16 21:37:37,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:37,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:37,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 21:37:37,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:37:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 21:37:37,286 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:37:37,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260305002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:37,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 21:37:37,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 21:37:37,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553531589] [2025-03-16 21:37:37,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:37,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 21:37:37,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:37,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 21:37:37,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 21:37:37,309 INFO L87 Difference]: Start difference. First operand has 870 states, 864 states have (on average 1.4976851851851851) internal successors, (1294), 865 states have internal predecessors, (1294), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:37:37,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:37,561 INFO L93 Difference]: Finished difference Result 1573 states and 2355 transitions. [2025-03-16 21:37:37,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 21:37:37,563 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 212 [2025-03-16 21:37:37,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:37,573 INFO L225 Difference]: With dead ends: 1573 [2025-03-16 21:37:37,573 INFO L226 Difference]: Without dead ends: 868 [2025-03-16 21:37:37,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 21:37:37,582 INFO L435 NwaCegarLoop]: 1083 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:37,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1083 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:37:37,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2025-03-16 21:37:37,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2025-03-16 21:37:37,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 863 states have (on average 1.4947856315179606) internal successors, (1290), 863 states have internal predecessors, (1290), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:37,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1296 transitions. [2025-03-16 21:37:37,642 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1296 transitions. Word has length 212 [2025-03-16 21:37:37,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:37,642 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1296 transitions. [2025-03-16 21:37:37,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:37:37,643 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1296 transitions. [2025-03-16 21:37:37,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-16 21:37:37,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:37,648 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:37,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 21:37:37,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 21:37:37,849 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:37,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:37,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1214787334, now seen corresponding path program 1 times [2025-03-16 21:37:37,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:37,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515272979] [2025-03-16 21:37:37,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:37,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:37,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-16 21:37:38,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-16 21:37:38,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:38,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:39,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:39,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515272979] [2025-03-16 21:37:39,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515272979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:39,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:39,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:37:39,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105764112] [2025-03-16 21:37:39,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:39,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:37:39,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:39,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:37:39,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:37:39,092 INFO L87 Difference]: Start difference. First operand 868 states and 1296 transitions. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:39,497 INFO L93 Difference]: Finished difference Result 872 states and 1300 transitions. [2025-03-16 21:37:39,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:39,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 212 [2025-03-16 21:37:39,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:39,501 INFO L225 Difference]: With dead ends: 872 [2025-03-16 21:37:39,501 INFO L226 Difference]: Without dead ends: 870 [2025-03-16 21:37:39,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:37:39,502 INFO L435 NwaCegarLoop]: 1081 mSDtfsCounter, 0 mSDsluCounter, 2157 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3238 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:39,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3238 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:37:39,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-03-16 21:37:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2025-03-16 21:37:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.4936416184971097) internal successors, (1292), 865 states have internal predecessors, (1292), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1298 transitions. [2025-03-16 21:37:39,522 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1298 transitions. Word has length 212 [2025-03-16 21:37:39,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:39,523 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1298 transitions. [2025-03-16 21:37:39,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1298 transitions. [2025-03-16 21:37:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-16 21:37:39,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:39,526 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:39,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 21:37:39,526 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:39,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:39,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1000978279, now seen corresponding path program 1 times [2025-03-16 21:37:39,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:39,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012774452] [2025-03-16 21:37:39,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:39,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-16 21:37:39,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-16 21:37:39,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:39,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:40,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:40,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012774452] [2025-03-16 21:37:40,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012774452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:40,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:40,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:40,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955625716] [2025-03-16 21:37:40,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:40,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:40,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:40,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:40,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:40,140 INFO L87 Difference]: Start difference. First operand 870 states and 1298 transitions. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:40,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:40,909 INFO L93 Difference]: Finished difference Result 2170 states and 3240 transitions. [2025-03-16 21:37:40,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:37:40,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 213 [2025-03-16 21:37:40,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:40,913 INFO L225 Difference]: With dead ends: 2170 [2025-03-16 21:37:40,915 INFO L226 Difference]: Without dead ends: 870 [2025-03-16 21:37:40,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:37:40,917 INFO L435 NwaCegarLoop]: 1100 mSDtfsCounter, 2674 mSDsluCounter, 1968 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2674 SdHoareTripleChecker+Valid, 3068 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:40,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2674 Valid, 3068 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:37:40,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-03-16 21:37:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2025-03-16 21:37:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.492485549132948) internal successors, (1291), 865 states have internal predecessors, (1291), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1297 transitions. [2025-03-16 21:37:40,936 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1297 transitions. Word has length 213 [2025-03-16 21:37:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:40,936 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1297 transitions. [2025-03-16 21:37:40,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1297 transitions. [2025-03-16 21:37:40,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-16 21:37:40,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:40,938 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:40,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 21:37:40,938 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:40,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:40,939 INFO L85 PathProgramCache]: Analyzing trace with hash 655144752, now seen corresponding path program 1 times [2025-03-16 21:37:40,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:40,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739554695] [2025-03-16 21:37:40,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:40,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:40,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-16 21:37:41,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-16 21:37:41,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:41,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:41,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:41,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:41,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739554695] [2025-03-16 21:37:41,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739554695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:41,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:41,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:37:41,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147089008] [2025-03-16 21:37:41,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:41,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:37:41,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:41,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:37:41,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:37:41,400 INFO L87 Difference]: Start difference. First operand 870 states and 1297 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:41,726 INFO L93 Difference]: Finished difference Result 1577 states and 2350 transitions. [2025-03-16 21:37:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:41,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 214 [2025-03-16 21:37:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:41,730 INFO L225 Difference]: With dead ends: 1577 [2025-03-16 21:37:41,730 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:41,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:37:41,731 INFO L435 NwaCegarLoop]: 1080 mSDtfsCounter, 0 mSDsluCounter, 2152 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3232 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:41,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3232 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:37:41,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.491349480968858) internal successors, (1293), 867 states have internal predecessors, (1293), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:41,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1299 transitions. [2025-03-16 21:37:41,747 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1299 transitions. Word has length 214 [2025-03-16 21:37:41,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:41,748 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1299 transitions. [2025-03-16 21:37:41,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:41,748 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1299 transitions. [2025-03-16 21:37:41,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-16 21:37:41,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:41,749 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:41,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 21:37:41,749 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:41,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:41,750 INFO L85 PathProgramCache]: Analyzing trace with hash 766160876, now seen corresponding path program 1 times [2025-03-16 21:37:41,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:41,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525218755] [2025-03-16 21:37:41,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:41,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:41,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-16 21:37:41,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-16 21:37:41,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:41,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:42,361 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:42,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:42,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525218755] [2025-03-16 21:37:42,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525218755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:42,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:42,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:37:42,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909216846] [2025-03-16 21:37:42,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:42,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:37:42,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:42,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:37:42,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:37:42,365 INFO L87 Difference]: Start difference. First operand 872 states and 1299 transitions. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:42,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:42,840 INFO L93 Difference]: Finished difference Result 1579 states and 2351 transitions. [2025-03-16 21:37:42,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:42,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 215 [2025-03-16 21:37:42,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:42,844 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:42,844 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:42,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:42,845 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 1132 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:42,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 1905 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:37:42,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:42,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:42,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4901960784313726) internal successors, (1292), 867 states have internal predecessors, (1292), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:42,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1298 transitions. [2025-03-16 21:37:42,861 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1298 transitions. Word has length 215 [2025-03-16 21:37:42,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:42,861 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1298 transitions. [2025-03-16 21:37:42,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:42,861 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1298 transitions. [2025-03-16 21:37:42,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-16 21:37:42,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:42,863 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:42,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 21:37:42,863 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:42,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:42,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1793678838, now seen corresponding path program 1 times [2025-03-16 21:37:42,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:42,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011228323] [2025-03-16 21:37:42,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:42,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:42,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-16 21:37:42,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-16 21:37:42,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:42,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:43,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:43,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011228323] [2025-03-16 21:37:43,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011228323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:43,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:43,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:43,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060425688] [2025-03-16 21:37:43,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:43,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:43,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:43,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:43,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:43,219 INFO L87 Difference]: Start difference. First operand 872 states and 1298 transitions. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:43,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:43,833 INFO L93 Difference]: Finished difference Result 1579 states and 2349 transitions. [2025-03-16 21:37:43,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:43,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 216 [2025-03-16 21:37:43,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:43,836 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:43,836 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:43,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:43,838 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 2409 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2412 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:43,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2412 Valid, 1905 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 21:37:43,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.489042675893887) internal successors, (1291), 867 states have internal predecessors, (1291), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:43,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1297 transitions. [2025-03-16 21:37:43,852 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1297 transitions. Word has length 216 [2025-03-16 21:37:43,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:43,852 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1297 transitions. [2025-03-16 21:37:43,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1297 transitions. [2025-03-16 21:37:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-16 21:37:43,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:43,854 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:43,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 21:37:43,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:43,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:43,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1303373113, now seen corresponding path program 1 times [2025-03-16 21:37:43,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:43,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727286973] [2025-03-16 21:37:43,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:43,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:43,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-16 21:37:43,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-16 21:37:43,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:43,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:44,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:44,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727286973] [2025-03-16 21:37:44,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727286973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:44,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:44,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:44,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651712061] [2025-03-16 21:37:44,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:44,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:44,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:44,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:44,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:44,205 INFO L87 Difference]: Start difference. First operand 872 states and 1297 transitions. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:44,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:44,674 INFO L93 Difference]: Finished difference Result 1579 states and 2347 transitions. [2025-03-16 21:37:44,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:44,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 217 [2025-03-16 21:37:44,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:44,678 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:44,679 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:44,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:44,681 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 1279 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:44,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 1911 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:37:44,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4878892733564013) internal successors, (1290), 867 states have internal predecessors, (1290), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1296 transitions. [2025-03-16 21:37:44,698 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1296 transitions. Word has length 217 [2025-03-16 21:37:44,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:44,698 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1296 transitions. [2025-03-16 21:37:44,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:44,699 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1296 transitions. [2025-03-16 21:37:44,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-16 21:37:44,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:44,700 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:44,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 21:37:44,701 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:44,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:44,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2108812165, now seen corresponding path program 1 times [2025-03-16 21:37:44,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:44,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794914450] [2025-03-16 21:37:44,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:44,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:44,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-16 21:37:44,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-16 21:37:44,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:44,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:45,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:45,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794914450] [2025-03-16 21:37:45,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794914450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:45,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:45,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:45,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394779170] [2025-03-16 21:37:45,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:45,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:45,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:45,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:45,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:45,026 INFO L87 Difference]: Start difference. First operand 872 states and 1296 transitions. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:45,536 INFO L93 Difference]: Finished difference Result 1579 states and 2345 transitions. [2025-03-16 21:37:45,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:45,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 218 [2025-03-16 21:37:45,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:45,540 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:45,540 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:45,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:45,541 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 2393 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2396 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:45,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2396 Valid, 1905 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:37:45,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:45,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:45,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4867358708189158) internal successors, (1289), 867 states have internal predecessors, (1289), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:45,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1295 transitions. [2025-03-16 21:37:45,560 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1295 transitions. Word has length 218 [2025-03-16 21:37:45,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:45,560 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1295 transitions. [2025-03-16 21:37:45,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:45,560 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1295 transitions. [2025-03-16 21:37:45,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-16 21:37:45,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:45,562 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:45,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 21:37:45,563 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:45,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:45,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1233067810, now seen corresponding path program 1 times [2025-03-16 21:37:45,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:45,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451932223] [2025-03-16 21:37:45,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:45,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:45,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-16 21:37:45,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-16 21:37:45,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:45,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:45,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:45,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451932223] [2025-03-16 21:37:45,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451932223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:45,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:45,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:45,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706145717] [2025-03-16 21:37:45,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:45,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:45,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:45,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:45,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:45,948 INFO L87 Difference]: Start difference. First operand 872 states and 1295 transitions. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:46,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:46,408 INFO L93 Difference]: Finished difference Result 1579 states and 2343 transitions. [2025-03-16 21:37:46,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:46,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 219 [2025-03-16 21:37:46,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:46,411 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:46,412 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:46,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:46,415 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 2385 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2388 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:46,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2388 Valid, 1905 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:37:46,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:46,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:46,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4855824682814303) internal successors, (1288), 867 states have internal predecessors, (1288), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1294 transitions. [2025-03-16 21:37:46,430 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1294 transitions. Word has length 219 [2025-03-16 21:37:46,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:46,431 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1294 transitions. [2025-03-16 21:37:46,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:46,431 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1294 transitions. [2025-03-16 21:37:46,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-16 21:37:46,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:46,433 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:46,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 21:37:46,433 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:46,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:46,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1471826304, now seen corresponding path program 1 times [2025-03-16 21:37:46,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:46,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579479287] [2025-03-16 21:37:46,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:46,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:46,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-16 21:37:46,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-16 21:37:46,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:46,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:46,724 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:46,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:46,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579479287] [2025-03-16 21:37:46,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579479287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:46,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:46,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:46,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866928540] [2025-03-16 21:37:46,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:46,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:46,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:46,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:46,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:46,726 INFO L87 Difference]: Start difference. First operand 872 states and 1294 transitions. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:47,183 INFO L93 Difference]: Finished difference Result 1579 states and 2341 transitions. [2025-03-16 21:37:47,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:47,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 220 [2025-03-16 21:37:47,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:47,188 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:47,188 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:47,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:47,189 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 2377 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2380 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:47,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2380 Valid, 1905 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:37:47,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:47,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:47,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4844290657439447) internal successors, (1287), 867 states have internal predecessors, (1287), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1293 transitions. [2025-03-16 21:37:47,203 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1293 transitions. Word has length 220 [2025-03-16 21:37:47,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:47,204 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1293 transitions. [2025-03-16 21:37:47,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:47,205 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1293 transitions. [2025-03-16 21:37:47,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-16 21:37:47,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:47,207 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:47,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 21:37:47,207 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:47,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:47,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1378648835, now seen corresponding path program 1 times [2025-03-16 21:37:47,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:47,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275037723] [2025-03-16 21:37:47,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:47,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:47,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-16 21:37:47,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-16 21:37:47,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:47,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:47,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:47,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275037723] [2025-03-16 21:37:47,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275037723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:47,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:47,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:47,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224692799] [2025-03-16 21:37:47,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:47,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:47,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:47,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:47,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:47,514 INFO L87 Difference]: Start difference. First operand 872 states and 1293 transitions. Second operand has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:47,970 INFO L93 Difference]: Finished difference Result 1579 states and 2339 transitions. [2025-03-16 21:37:47,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:47,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 221 [2025-03-16 21:37:47,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:47,973 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:47,973 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:47,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:47,975 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 1263 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:47,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 1911 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:37:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:47,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:47,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.483275663206459) internal successors, (1286), 867 states have internal predecessors, (1286), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1292 transitions. [2025-03-16 21:37:47,989 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1292 transitions. Word has length 221 [2025-03-16 21:37:47,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:47,989 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1292 transitions. [2025-03-16 21:37:47,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:47,989 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1292 transitions. [2025-03-16 21:37:47,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-16 21:37:47,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:47,991 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:47,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 21:37:47,991 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:47,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:47,991 INFO L85 PathProgramCache]: Analyzing trace with hash -405028101, now seen corresponding path program 1 times [2025-03-16 21:37:47,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:47,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647977164] [2025-03-16 21:37:47,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:47,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:48,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-16 21:37:48,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-16 21:37:48,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:48,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:48,261 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:48,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:48,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647977164] [2025-03-16 21:37:48,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647977164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:48,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:48,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:48,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757245494] [2025-03-16 21:37:48,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:48,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:48,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:48,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:48,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:48,263 INFO L87 Difference]: Start difference. First operand 872 states and 1292 transitions. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:48,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:48,713 INFO L93 Difference]: Finished difference Result 1579 states and 2337 transitions. [2025-03-16 21:37:48,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:48,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 222 [2025-03-16 21:37:48,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:48,718 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:48,718 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:48,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:48,720 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 2361 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2364 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:48,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2364 Valid, 1905 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:37:48,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:48,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4821222606689735) internal successors, (1285), 867 states have internal predecessors, (1285), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:48,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1291 transitions. [2025-03-16 21:37:48,734 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1291 transitions. Word has length 222 [2025-03-16 21:37:48,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:48,734 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1291 transitions. [2025-03-16 21:37:48,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1291 transitions. [2025-03-16 21:37:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-16 21:37:48,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:48,736 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:48,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 21:37:48,737 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:48,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:48,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1426650200, now seen corresponding path program 1 times [2025-03-16 21:37:48,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:48,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906776906] [2025-03-16 21:37:48,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:48,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:48,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-16 21:37:48,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-16 21:37:48,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:48,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:49,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:49,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906776906] [2025-03-16 21:37:49,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906776906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:49,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:49,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:49,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371647447] [2025-03-16 21:37:49,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:49,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:49,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:49,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:49,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:49,059 INFO L87 Difference]: Start difference. First operand 872 states and 1291 transitions. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:49,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:49,498 INFO L93 Difference]: Finished difference Result 1579 states and 2335 transitions. [2025-03-16 21:37:49,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:49,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 223 [2025-03-16 21:37:49,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:49,502 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:49,502 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:49,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:49,503 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 1255 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:49,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 1911 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:37:49,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:49,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:49,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.480968858131488) internal successors, (1284), 867 states have internal predecessors, (1284), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:49,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1290 transitions. [2025-03-16 21:37:49,516 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1290 transitions. Word has length 223 [2025-03-16 21:37:49,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:49,516 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1290 transitions. [2025-03-16 21:37:49,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1290 transitions. [2025-03-16 21:37:49,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-16 21:37:49,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:49,518 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:49,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 21:37:49,518 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:49,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:49,519 INFO L85 PathProgramCache]: Analyzing trace with hash -350367498, now seen corresponding path program 1 times [2025-03-16 21:37:49,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:49,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568864813] [2025-03-16 21:37:49,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:49,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:49,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-16 21:37:49,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-16 21:37:49,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:49,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:49,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:49,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568864813] [2025-03-16 21:37:49,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568864813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:49,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:49,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:49,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710674997] [2025-03-16 21:37:49,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:49,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:49,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:49,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:49,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:49,786 INFO L87 Difference]: Start difference. First operand 872 states and 1290 transitions. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:50,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:50,212 INFO L93 Difference]: Finished difference Result 1579 states and 2333 transitions. [2025-03-16 21:37:50,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:50,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 224 [2025-03-16 21:37:50,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:50,215 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:50,215 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:50,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:50,216 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 2345 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2348 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:50,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2348 Valid, 1905 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:37:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:50,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4798154555940024) internal successors, (1283), 867 states have internal predecessors, (1283), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1289 transitions. [2025-03-16 21:37:50,228 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1289 transitions. Word has length 224 [2025-03-16 21:37:50,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:50,229 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1289 transitions. [2025-03-16 21:37:50,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:50,229 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1289 transitions. [2025-03-16 21:37:50,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-16 21:37:50,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:50,230 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:50,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 21:37:50,231 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:50,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:50,231 INFO L85 PathProgramCache]: Analyzing trace with hash 804996403, now seen corresponding path program 1 times [2025-03-16 21:37:50,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:50,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185566978] [2025-03-16 21:37:50,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:50,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:50,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-16 21:37:50,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-16 21:37:50,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:50,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:50,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:50,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185566978] [2025-03-16 21:37:50,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185566978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:50,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:50,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:50,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665874277] [2025-03-16 21:37:50,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:50,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:50,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:50,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:50,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:50,506 INFO L87 Difference]: Start difference. First operand 872 states and 1289 transitions. Second operand has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:50,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:50,936 INFO L93 Difference]: Finished difference Result 1579 states and 2331 transitions. [2025-03-16 21:37:50,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:50,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 225 [2025-03-16 21:37:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:50,942 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:50,942 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:50,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:50,944 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 2337 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2340 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:50,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2340 Valid, 1905 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:37:50,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:50,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4786620530565167) internal successors, (1282), 867 states have internal predecessors, (1282), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1288 transitions. [2025-03-16 21:37:50,955 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1288 transitions. Word has length 225 [2025-03-16 21:37:50,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:50,955 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1288 transitions. [2025-03-16 21:37:50,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1288 transitions. [2025-03-16 21:37:50,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 21:37:50,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:50,957 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:50,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 21:37:50,957 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:50,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:50,958 INFO L85 PathProgramCache]: Analyzing trace with hash -598368143, now seen corresponding path program 1 times [2025-03-16 21:37:50,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:50,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796240488] [2025-03-16 21:37:50,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:50,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:51,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 21:37:51,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 21:37:51,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:51,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:51,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:51,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:51,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796240488] [2025-03-16 21:37:51,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796240488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:51,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:51,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:51,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087726969] [2025-03-16 21:37:51,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:51,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:51,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:51,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:51,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:51,272 INFO L87 Difference]: Start difference. First operand 872 states and 1288 transitions. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:51,681 INFO L93 Difference]: Finished difference Result 1579 states and 2329 transitions. [2025-03-16 21:37:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:51,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 226 [2025-03-16 21:37:51,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:51,684 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:51,684 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:51,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:51,687 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 1243 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:51,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 1911 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:37:51,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:51,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4775086505190311) internal successors, (1281), 867 states have internal predecessors, (1281), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1287 transitions. [2025-03-16 21:37:51,699 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1287 transitions. Word has length 226 [2025-03-16 21:37:51,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:51,703 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1287 transitions. [2025-03-16 21:37:51,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1287 transitions. [2025-03-16 21:37:51,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-16 21:37:51,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:51,706 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:51,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 21:37:51,706 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:51,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:51,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1789276046, now seen corresponding path program 1 times [2025-03-16 21:37:51,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:51,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445393490] [2025-03-16 21:37:51,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:51,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:51,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 21:37:51,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 21:37:51,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:51,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:51,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:51,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:51,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445393490] [2025-03-16 21:37:51,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445393490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:51,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:51,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:51,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676110177] [2025-03-16 21:37:51,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:51,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:51,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:51,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:51,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:51,994 INFO L87 Difference]: Start difference. First operand 872 states and 1287 transitions. Second operand has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:52,399 INFO L93 Difference]: Finished difference Result 1579 states and 2327 transitions. [2025-03-16 21:37:52,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:52,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 227 [2025-03-16 21:37:52,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:52,402 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:52,402 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:52,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:52,403 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 2321 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2324 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:52,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2324 Valid, 1905 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:37:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:52,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4763552479815456) internal successors, (1280), 867 states have internal predecessors, (1280), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1286 transitions. [2025-03-16 21:37:52,415 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1286 transitions. Word has length 227 [2025-03-16 21:37:52,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:52,415 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1286 transitions. [2025-03-16 21:37:52,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1286 transitions. [2025-03-16 21:37:52,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-16 21:37:52,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:52,417 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:52,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 21:37:52,417 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:52,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:52,417 INFO L85 PathProgramCache]: Analyzing trace with hash 23916908, now seen corresponding path program 1 times [2025-03-16 21:37:52,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:52,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882891434] [2025-03-16 21:37:52,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:52,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:52,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-16 21:37:52,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-16 21:37:52,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:52,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:52,794 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:52,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:52,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882891434] [2025-03-16 21:37:52,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882891434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:52,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:52,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:52,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249009588] [2025-03-16 21:37:52,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:52,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:52,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:52,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:52,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:52,795 INFO L87 Difference]: Start difference. First operand 872 states and 1286 transitions. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:53,183 INFO L93 Difference]: Finished difference Result 1579 states and 2325 transitions. [2025-03-16 21:37:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:53,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 228 [2025-03-16 21:37:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:53,186 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:53,186 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:53,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:53,188 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 2313 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2316 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:53,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2316 Valid, 1905 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:37:53,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:53,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.47520184544406) internal successors, (1279), 867 states have internal predecessors, (1279), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1285 transitions. [2025-03-16 21:37:53,201 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1285 transitions. Word has length 228 [2025-03-16 21:37:53,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:53,201 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1285 transitions. [2025-03-16 21:37:53,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:53,202 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1285 transitions. [2025-03-16 21:37:53,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-16 21:37:53,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:53,203 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:53,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 21:37:53,204 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:53,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:53,204 INFO L85 PathProgramCache]: Analyzing trace with hash 740651881, now seen corresponding path program 1 times [2025-03-16 21:37:53,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:53,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873543812] [2025-03-16 21:37:53,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:53,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:53,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-16 21:37:53,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-16 21:37:53,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:53,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:53,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:53,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873543812] [2025-03-16 21:37:53,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873543812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:53,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:53,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:53,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007759802] [2025-03-16 21:37:53,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:53,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:53,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:53,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:53,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:53,512 INFO L87 Difference]: Start difference. First operand 872 states and 1285 transitions. Second operand has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:53,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:53,856 INFO L93 Difference]: Finished difference Result 1579 states and 2323 transitions. [2025-03-16 21:37:53,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:53,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 229 [2025-03-16 21:37:53,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:53,858 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:53,858 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:53,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:53,859 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 1231 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:53,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 1911 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:37:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:53,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4740484429065743) internal successors, (1278), 867 states have internal predecessors, (1278), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:53,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1284 transitions. [2025-03-16 21:37:53,869 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1284 transitions. Word has length 229 [2025-03-16 21:37:53,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:53,869 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1284 transitions. [2025-03-16 21:37:53,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:53,869 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1284 transitions. [2025-03-16 21:37:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-16 21:37:53,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:53,870 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:53,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 21:37:53,870 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:53,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:53,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1542292455, now seen corresponding path program 1 times [2025-03-16 21:37:53,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:53,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970908091] [2025-03-16 21:37:53,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:53,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:53,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-16 21:37:53,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-16 21:37:53,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:53,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:54,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:54,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970908091] [2025-03-16 21:37:54,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970908091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:54,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:54,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:54,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516185087] [2025-03-16 21:37:54,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:54,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:54,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:54,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:54,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:54,126 INFO L87 Difference]: Start difference. First operand 872 states and 1284 transitions. Second operand has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:54,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:54,491 INFO L93 Difference]: Finished difference Result 1579 states and 2321 transitions. [2025-03-16 21:37:54,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:54,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 230 [2025-03-16 21:37:54,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:54,493 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:54,493 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:54,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:54,494 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 1227 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:54,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 1911 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:37:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:54,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:54,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4728950403690888) internal successors, (1277), 867 states have internal predecessors, (1277), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1283 transitions. [2025-03-16 21:37:54,504 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1283 transitions. Word has length 230 [2025-03-16 21:37:54,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:54,504 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1283 transitions. [2025-03-16 21:37:54,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1283 transitions. [2025-03-16 21:37:54,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-16 21:37:54,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:54,505 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:54,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 21:37:54,506 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:54,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:54,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1454690500, now seen corresponding path program 1 times [2025-03-16 21:37:54,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:54,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470977897] [2025-03-16 21:37:54,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:54,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:54,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-16 21:37:54,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-16 21:37:54,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:54,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:54,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:54,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470977897] [2025-03-16 21:37:54,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470977897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:54,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:54,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:37:54,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160940166] [2025-03-16 21:37:54,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:54,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:37:54,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:54,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:37:54,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:37:54,876 INFO L87 Difference]: Start difference. First operand 872 states and 1283 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:55,156 INFO L93 Difference]: Finished difference Result 1579 states and 2319 transitions. [2025-03-16 21:37:55,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:55,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 231 [2025-03-16 21:37:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:55,159 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:55,159 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:55,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:55,160 INFO L435 NwaCegarLoop]: 1032 mSDtfsCounter, 1134 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:55,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 2065 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:37:55,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:55,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:55,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4717416378316033) internal successors, (1276), 867 states have internal predecessors, (1276), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:55,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1282 transitions. [2025-03-16 21:37:55,170 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1282 transitions. Word has length 231 [2025-03-16 21:37:55,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:55,170 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1282 transitions. [2025-03-16 21:37:55,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:55,171 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1282 transitions. [2025-03-16 21:37:55,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-16 21:37:55,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:55,172 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:55,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 21:37:55,172 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:55,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:55,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1503371439, now seen corresponding path program 1 times [2025-03-16 21:37:55,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:55,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231482382] [2025-03-16 21:37:55,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:55,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:55,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-16 21:37:55,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-16 21:37:55,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:55,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:55,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:55,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231482382] [2025-03-16 21:37:55,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231482382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:55,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:55,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:55,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793708449] [2025-03-16 21:37:55,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:55,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:55,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:55,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:55,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:55,419 INFO L87 Difference]: Start difference. First operand 872 states and 1282 transitions. Second operand has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:55,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:55,797 INFO L93 Difference]: Finished difference Result 1585 states and 2325 transitions. [2025-03-16 21:37:55,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:37:55,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 232 [2025-03-16 21:37:55,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:55,802 INFO L225 Difference]: With dead ends: 1585 [2025-03-16 21:37:55,802 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:55,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:37:55,803 INFO L435 NwaCegarLoop]: 1057 mSDtfsCounter, 1145 mSDsluCounter, 2092 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 3149 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:55,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 3149 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:37:55,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:55,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4705882352941178) internal successors, (1275), 867 states have internal predecessors, (1275), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1281 transitions. [2025-03-16 21:37:55,815 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1281 transitions. Word has length 232 [2025-03-16 21:37:55,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:55,815 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1281 transitions. [2025-03-16 21:37:55,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:55,816 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1281 transitions. [2025-03-16 21:37:55,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-16 21:37:55,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:55,817 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:55,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 21:37:55,817 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:55,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:55,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1502454635, now seen corresponding path program 1 times [2025-03-16 21:37:55,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:55,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50701827] [2025-03-16 21:37:55,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:55,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:55,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-16 21:37:55,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-16 21:37:55,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:55,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:56,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:56,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50701827] [2025-03-16 21:37:56,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50701827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:56,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:56,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:56,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184345740] [2025-03-16 21:37:56,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:56,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:56,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:56,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:56,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:56,075 INFO L87 Difference]: Start difference. First operand 872 states and 1281 transitions. Second operand has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:56,399 INFO L93 Difference]: Finished difference Result 1579 states and 2315 transitions. [2025-03-16 21:37:56,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:56,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 233 [2025-03-16 21:37:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:56,402 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:56,402 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:56,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:56,403 INFO L435 NwaCegarLoop]: 1032 mSDtfsCounter, 1266 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 2071 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:56,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 2071 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:37:56,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:56,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.469434832756632) internal successors, (1274), 867 states have internal predecessors, (1274), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1280 transitions. [2025-03-16 21:37:56,411 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1280 transitions. Word has length 233 [2025-03-16 21:37:56,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:56,411 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1280 transitions. [2025-03-16 21:37:56,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1280 transitions. [2025-03-16 21:37:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-16 21:37:56,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:56,412 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:56,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 21:37:56,413 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:56,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:56,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2014285644, now seen corresponding path program 1 times [2025-03-16 21:37:56,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:56,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519187952] [2025-03-16 21:37:56,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:56,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:56,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-16 21:37:56,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-16 21:37:56,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:56,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:56,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:56,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519187952] [2025-03-16 21:37:56,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519187952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:56,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:56,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:56,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666241298] [2025-03-16 21:37:56,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:56,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:56,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:56,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:56,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:56,666 INFO L87 Difference]: Start difference. First operand 872 states and 1280 transitions. Second operand has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:56,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:56,918 INFO L93 Difference]: Finished difference Result 1579 states and 2313 transitions. [2025-03-16 21:37:56,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:56,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 234 [2025-03-16 21:37:56,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:56,921 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:56,921 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:56,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:56,922 INFO L435 NwaCegarLoop]: 1032 mSDtfsCounter, 1262 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 2071 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:56,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 2071 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:37:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:56,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4682814302191465) internal successors, (1273), 867 states have internal predecessors, (1273), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:56,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1279 transitions. [2025-03-16 21:37:56,930 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1279 transitions. Word has length 234 [2025-03-16 21:37:56,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:56,930 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1279 transitions. [2025-03-16 21:37:56,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:56,930 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1279 transitions. [2025-03-16 21:37:56,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-16 21:37:56,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:56,931 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:56,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 21:37:56,931 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:56,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:56,931 INFO L85 PathProgramCache]: Analyzing trace with hash -787988230, now seen corresponding path program 1 times [2025-03-16 21:37:56,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:56,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135618488] [2025-03-16 21:37:56,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:56,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:56,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-16 21:37:57,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-16 21:37:57,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:57,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:57,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:57,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135618488] [2025-03-16 21:37:57,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135618488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:57,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:57,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:37:57,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709830334] [2025-03-16 21:37:57,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:57,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:37:57,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:57,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:37:57,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:37:57,262 INFO L87 Difference]: Start difference. First operand 872 states and 1279 transitions. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:57,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:57,546 INFO L93 Difference]: Finished difference Result 1579 states and 2311 transitions. [2025-03-16 21:37:57,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:57,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 235 [2025-03-16 21:37:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:57,548 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:57,548 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:57,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:57,549 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 1110 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:57,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 1993 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:37:57,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:57,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.467128027681661) internal successors, (1272), 867 states have internal predecessors, (1272), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:57,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1278 transitions. [2025-03-16 21:37:57,563 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1278 transitions. Word has length 235 [2025-03-16 21:37:57,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:57,563 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1278 transitions. [2025-03-16 21:37:57,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:57,563 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1278 transitions. [2025-03-16 21:37:57,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-16 21:37:57,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:57,564 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:57,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 21:37:57,564 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:57,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:57,564 INFO L85 PathProgramCache]: Analyzing trace with hash -21256431, now seen corresponding path program 1 times [2025-03-16 21:37:57,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:57,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693942114] [2025-03-16 21:37:57,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:57,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-16 21:37:57,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-16 21:37:57,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:57,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:57,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:57,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693942114] [2025-03-16 21:37:57,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693942114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:57,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:57,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:57,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61011680] [2025-03-16 21:37:57,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:57,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:57,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:57,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:57,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:57,844 INFO L87 Difference]: Start difference. First operand 872 states and 1278 transitions. Second operand has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:58,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:58,202 INFO L93 Difference]: Finished difference Result 1593 states and 2329 transitions. [2025-03-16 21:37:58,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:37:58,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 236 [2025-03-16 21:37:58,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:58,204 INFO L225 Difference]: With dead ends: 1593 [2025-03-16 21:37:58,204 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:58,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:37:58,205 INFO L435 NwaCegarLoop]: 1049 mSDtfsCounter, 1137 mSDsluCounter, 2048 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 3097 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:58,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 3097 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:37:58,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:58,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:58,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4659746251441754) internal successors, (1271), 867 states have internal predecessors, (1271), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1277 transitions. [2025-03-16 21:37:58,213 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1277 transitions. Word has length 236 [2025-03-16 21:37:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:58,213 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1277 transitions. [2025-03-16 21:37:58,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1277 transitions. [2025-03-16 21:37:58,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-16 21:37:58,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:58,214 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:58,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 21:37:58,214 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:58,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:58,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1065804727, now seen corresponding path program 1 times [2025-03-16 21:37:58,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:58,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106223847] [2025-03-16 21:37:58,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:58,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:58,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-16 21:37:58,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-16 21:37:58,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:58,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:58,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:58,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106223847] [2025-03-16 21:37:58,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106223847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:58,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:58,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:58,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105461546] [2025-03-16 21:37:58,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:58,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:58,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:58,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:58,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:58,464 INFO L87 Difference]: Start difference. First operand 872 states and 1277 transitions. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:58,793 INFO L93 Difference]: Finished difference Result 1579 states and 2307 transitions. [2025-03-16 21:37:58,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:58,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 237 [2025-03-16 21:37:58,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:58,795 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:58,796 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:58,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:58,797 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 2379 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2382 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:58,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2382 Valid, 1993 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:37:58,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:58,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4648212226066897) internal successors, (1270), 867 states have internal predecessors, (1270), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1276 transitions. [2025-03-16 21:37:58,805 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1276 transitions. Word has length 237 [2025-03-16 21:37:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:58,806 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1276 transitions. [2025-03-16 21:37:58,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1276 transitions. [2025-03-16 21:37:58,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-16 21:37:58,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:58,807 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:58,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 21:37:58,807 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:58,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:58,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1961450474, now seen corresponding path program 1 times [2025-03-16 21:37:58,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:58,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490645196] [2025-03-16 21:37:58,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:58,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:58,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-16 21:37:58,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-16 21:37:58,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:58,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:59,051 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:59,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:59,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490645196] [2025-03-16 21:37:59,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490645196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:59,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:59,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:59,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758685076] [2025-03-16 21:37:59,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:59,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:59,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:59,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:59,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:59,052 INFO L87 Difference]: Start difference. First operand 872 states and 1276 transitions. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:59,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:59,331 INFO L93 Difference]: Finished difference Result 1579 states and 2305 transitions. [2025-03-16 21:37:59,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:37:59,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 238 [2025-03-16 21:37:59,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:59,334 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:37:59,334 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:37:59,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:59,335 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 1258 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:59,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 1999 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:37:59,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:37:59,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:37:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4636678200692042) internal successors, (1269), 867 states have internal predecessors, (1269), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:37:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1275 transitions. [2025-03-16 21:37:59,344 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1275 transitions. Word has length 238 [2025-03-16 21:37:59,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:59,345 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1275 transitions. [2025-03-16 21:37:59,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:59,345 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1275 transitions. [2025-03-16 21:37:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-16 21:37:59,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:59,347 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:59,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 21:37:59,347 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:59,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:59,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1404459748, now seen corresponding path program 1 times [2025-03-16 21:37:59,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:59,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579199831] [2025-03-16 21:37:59,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:59,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:59,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-16 21:37:59,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-16 21:37:59,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:59,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:37:59,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:59,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579199831] [2025-03-16 21:37:59,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579199831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:59,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:59,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:59,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495575624] [2025-03-16 21:37:59,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:59,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:59,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:59,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:59,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:59,811 INFO L87 Difference]: Start difference. First operand 872 states and 1275 transitions. Second operand has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:00,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:00,201 INFO L93 Difference]: Finished difference Result 1579 states and 2303 transitions. [2025-03-16 21:38:00,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:00,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 239 [2025-03-16 21:38:00,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:00,203 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:00,203 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:00,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:00,205 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 1254 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:00,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 1999 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:38:00,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:00,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4625144175317186) internal successors, (1268), 867 states have internal predecessors, (1268), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1274 transitions. [2025-03-16 21:38:00,214 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1274 transitions. Word has length 239 [2025-03-16 21:38:00,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:00,214 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1274 transitions. [2025-03-16 21:38:00,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:00,214 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1274 transitions. [2025-03-16 21:38:00,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-16 21:38:00,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:00,215 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:00,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 21:38:00,215 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:00,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash 726939, now seen corresponding path program 1 times [2025-03-16 21:38:00,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:00,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658964711] [2025-03-16 21:38:00,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:00,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:00,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-16 21:38:00,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-16 21:38:00,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:00,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:00,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:00,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:00,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658964711] [2025-03-16 21:38:00,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658964711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:00,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:00,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:00,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548905991] [2025-03-16 21:38:00,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:00,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:00,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:00,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:00,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:00,503 INFO L87 Difference]: Start difference. First operand 872 states and 1274 transitions. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:00,782 INFO L93 Difference]: Finished difference Result 1579 states and 2301 transitions. [2025-03-16 21:38:00,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:00,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 240 [2025-03-16 21:38:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:00,784 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:00,784 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:00,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:00,785 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 2355 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2358 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:00,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2358 Valid, 1993 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:00,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:00,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4613610149942329) internal successors, (1267), 867 states have internal predecessors, (1267), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1273 transitions. [2025-03-16 21:38:00,794 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1273 transitions. Word has length 240 [2025-03-16 21:38:00,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:00,795 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1273 transitions. [2025-03-16 21:38:00,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:00,795 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1273 transitions. [2025-03-16 21:38:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-03-16 21:38:00,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:00,796 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:00,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 21:38:00,796 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:00,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:00,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1961085695, now seen corresponding path program 1 times [2025-03-16 21:38:00,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:00,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394819446] [2025-03-16 21:38:00,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:00,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:00,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-16 21:38:00,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-16 21:38:00,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:00,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:01,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:01,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:01,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394819446] [2025-03-16 21:38:01,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394819446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:01,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:01,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:01,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66696256] [2025-03-16 21:38:01,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:01,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:01,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:01,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:01,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:01,068 INFO L87 Difference]: Start difference. First operand 872 states and 1273 transitions. Second operand has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:01,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:01,344 INFO L93 Difference]: Finished difference Result 1579 states and 2299 transitions. [2025-03-16 21:38:01,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:01,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 241 [2025-03-16 21:38:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:01,346 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:01,346 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:01,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:01,347 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 1246 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:01,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1249 Valid, 1999 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:01,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:01,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4602076124567474) internal successors, (1266), 867 states have internal predecessors, (1266), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1272 transitions. [2025-03-16 21:38:01,356 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1272 transitions. Word has length 241 [2025-03-16 21:38:01,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:01,356 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1272 transitions. [2025-03-16 21:38:01,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:01,356 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1272 transitions. [2025-03-16 21:38:01,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-16 21:38:01,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:01,357 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:01,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 21:38:01,357 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:01,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:01,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1568849504, now seen corresponding path program 1 times [2025-03-16 21:38:01,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:01,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354759747] [2025-03-16 21:38:01,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:01,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:01,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-16 21:38:01,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-16 21:38:01,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:01,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:01,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:01,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354759747] [2025-03-16 21:38:01,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354759747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:01,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:01,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:01,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835406282] [2025-03-16 21:38:01,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:01,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:01,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:01,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:01,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:01,635 INFO L87 Difference]: Start difference. First operand 872 states and 1272 transitions. Second operand has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:02,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:02,015 INFO L93 Difference]: Finished difference Result 1579 states and 2297 transitions. [2025-03-16 21:38:02,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:02,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 242 [2025-03-16 21:38:02,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:02,019 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:02,019 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:02,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:02,020 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 1242 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:02,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 1999 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:02,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:02,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:02,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4590542099192618) internal successors, (1265), 867 states have internal predecessors, (1265), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1271 transitions. [2025-03-16 21:38:02,035 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1271 transitions. Word has length 242 [2025-03-16 21:38:02,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:02,036 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1271 transitions. [2025-03-16 21:38:02,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1271 transitions. [2025-03-16 21:38:02,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-03-16 21:38:02,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:02,037 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:02,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 21:38:02,037 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:02,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:02,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1792748698, now seen corresponding path program 1 times [2025-03-16 21:38:02,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:02,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717848110] [2025-03-16 21:38:02,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:02,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:02,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-03-16 21:38:02,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-03-16 21:38:02,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:02,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:02,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:02,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:02,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717848110] [2025-03-16 21:38:02,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717848110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:02,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:02,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:02,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481026155] [2025-03-16 21:38:02,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:02,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:38:02,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:02,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:38:02,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:02,442 INFO L87 Difference]: Start difference. First operand 872 states and 1271 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:02,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:02,677 INFO L93 Difference]: Finished difference Result 1579 states and 2295 transitions. [2025-03-16 21:38:02,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:02,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 243 [2025-03-16 21:38:02,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:02,678 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:02,678 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:02,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:02,679 INFO L435 NwaCegarLoop]: 1036 mSDtfsCounter, 1131 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 2073 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:02,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 2073 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:02,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:02,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4567474048442905) internal successors, (1263), 867 states have internal predecessors, (1263), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:02,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1269 transitions. [2025-03-16 21:38:02,688 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1269 transitions. Word has length 243 [2025-03-16 21:38:02,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:02,688 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1269 transitions. [2025-03-16 21:38:02,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1269 transitions. [2025-03-16 21:38:02,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-16 21:38:02,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:02,689 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:02,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 21:38:02,689 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:02,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:02,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1725872878, now seen corresponding path program 1 times [2025-03-16 21:38:02,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:02,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191975115] [2025-03-16 21:38:02,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:02,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:02,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-16 21:38:02,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-16 21:38:02,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:02,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:03,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:03,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191975115] [2025-03-16 21:38:03,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191975115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:03,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:03,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:03,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674503955] [2025-03-16 21:38:03,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:03,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:03,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:03,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:03,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:03,024 INFO L87 Difference]: Start difference. First operand 872 states and 1269 transitions. Second operand has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:03,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:03,324 INFO L93 Difference]: Finished difference Result 1579 states and 2291 transitions. [2025-03-16 21:38:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:03,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 245 [2025-03-16 21:38:03,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:03,329 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:03,330 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:03,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:03,331 INFO L435 NwaCegarLoop]: 1036 mSDtfsCounter, 1253 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:03,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 2079 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:03,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:03,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.455594002306805) internal successors, (1262), 867 states have internal predecessors, (1262), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1268 transitions. [2025-03-16 21:38:03,341 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1268 transitions. Word has length 245 [2025-03-16 21:38:03,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:03,342 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1268 transitions. [2025-03-16 21:38:03,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1268 transitions. [2025-03-16 21:38:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-16 21:38:03,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:03,343 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:03,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 21:38:03,343 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:03,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:03,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1867517859, now seen corresponding path program 1 times [2025-03-16 21:38:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:03,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731413447] [2025-03-16 21:38:03,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:03,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:03,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-16 21:38:03,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-16 21:38:03,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:03,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:03,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:03,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:03,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731413447] [2025-03-16 21:38:03,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731413447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:03,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:03,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:03,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738411504] [2025-03-16 21:38:03,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:03,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:38:03,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:03,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:38:03,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:03,727 INFO L87 Difference]: Start difference. First operand 872 states and 1268 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:38:04,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:04,037 INFO L93 Difference]: Finished difference Result 1579 states and 2289 transitions. [2025-03-16 21:38:04,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:04,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 246 [2025-03-16 21:38:04,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:04,038 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:04,038 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:04,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:04,040 INFO L435 NwaCegarLoop]: 1038 mSDtfsCounter, 1166 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:04,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 2077 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:04,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:04,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4544405997693195) internal successors, (1261), 867 states have internal predecessors, (1261), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1267 transitions. [2025-03-16 21:38:04,054 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1267 transitions. Word has length 246 [2025-03-16 21:38:04,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:04,054 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1267 transitions. [2025-03-16 21:38:04,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:38:04,055 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1267 transitions. [2025-03-16 21:38:04,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-16 21:38:04,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:04,056 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:04,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 21:38:04,056 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:04,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:04,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1134336834, now seen corresponding path program 1 times [2025-03-16 21:38:04,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:04,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496067497] [2025-03-16 21:38:04,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:04,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:04,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-16 21:38:04,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-16 21:38:04,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:04,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:04,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:04,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496067497] [2025-03-16 21:38:04,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496067497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:04,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:04,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:04,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752712392] [2025-03-16 21:38:04,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:04,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:04,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:04,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:04,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:04,872 INFO L87 Difference]: Start difference. First operand 872 states and 1267 transitions. Second operand has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:05,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:05,307 INFO L93 Difference]: Finished difference Result 1585 states and 2295 transitions. [2025-03-16 21:38:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:38:05,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 247 [2025-03-16 21:38:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:05,310 INFO L225 Difference]: With dead ends: 1585 [2025-03-16 21:38:05,310 INFO L226 Difference]: Without dead ends: 876 [2025-03-16 21:38:05,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:05,311 INFO L435 NwaCegarLoop]: 1045 mSDtfsCounter, 2 mSDsluCounter, 2916 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3961 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:05,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3961 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:38:05,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-03-16 21:38:05,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 874. [2025-03-16 21:38:05,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4533947065592636) internal successors, (1263), 869 states have internal predecessors, (1263), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1269 transitions. [2025-03-16 21:38:05,322 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1269 transitions. Word has length 247 [2025-03-16 21:38:05,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:05,322 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1269 transitions. [2025-03-16 21:38:05,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1269 transitions. [2025-03-16 21:38:05,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-16 21:38:05,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:05,324 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:05,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 21:38:05,324 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:05,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:05,324 INFO L85 PathProgramCache]: Analyzing trace with hash -801620999, now seen corresponding path program 1 times [2025-03-16 21:38:05,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:05,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511115231] [2025-03-16 21:38:05,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:05,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:05,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-16 21:38:05,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-16 21:38:05,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:05,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:05,947 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:05,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:05,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511115231] [2025-03-16 21:38:05,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511115231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:05,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:05,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:05,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433709586] [2025-03-16 21:38:05,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:05,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:05,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:05,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:05,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:05,950 INFO L87 Difference]: Start difference. First operand 874 states and 1269 transitions. Second operand has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:06,337 INFO L93 Difference]: Finished difference Result 1583 states and 2291 transitions. [2025-03-16 21:38:06,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:06,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 248 [2025-03-16 21:38:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:06,339 INFO L225 Difference]: With dead ends: 1583 [2025-03-16 21:38:06,339 INFO L226 Difference]: Without dead ends: 874 [2025-03-16 21:38:06,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:06,340 INFO L435 NwaCegarLoop]: 992 mSDtfsCounter, 1107 mSDsluCounter, 1980 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 2972 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:06,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 2972 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:38:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-16 21:38:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2025-03-16 21:38:06,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4522439585730724) internal successors, (1262), 869 states have internal predecessors, (1262), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:06,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1268 transitions. [2025-03-16 21:38:06,351 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1268 transitions. Word has length 248 [2025-03-16 21:38:06,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:06,351 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1268 transitions. [2025-03-16 21:38:06,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:06,352 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1268 transitions. [2025-03-16 21:38:06,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-16 21:38:06,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:06,353 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:06,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 21:38:06,353 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:06,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:06,354 INFO L85 PathProgramCache]: Analyzing trace with hash -884089664, now seen corresponding path program 1 times [2025-03-16 21:38:06,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:06,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466729834] [2025-03-16 21:38:06,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:06,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:06,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-16 21:38:06,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-16 21:38:06,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:06,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:06,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:06,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466729834] [2025-03-16 21:38:06,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466729834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:06,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:06,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:06,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761447427] [2025-03-16 21:38:06,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:06,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:06,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:06,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:06,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:06,849 INFO L87 Difference]: Start difference. First operand 874 states and 1268 transitions. Second operand has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:07,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:07,222 INFO L93 Difference]: Finished difference Result 1583 states and 2289 transitions. [2025-03-16 21:38:07,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:07,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 249 [2025-03-16 21:38:07,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:07,225 INFO L225 Difference]: With dead ends: 1583 [2025-03-16 21:38:07,225 INFO L226 Difference]: Without dead ends: 874 [2025-03-16 21:38:07,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:07,226 INFO L435 NwaCegarLoop]: 992 mSDtfsCounter, 2204 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2204 SdHoareTripleChecker+Valid, 1985 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:07,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2204 Valid, 1985 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:07,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-16 21:38:07,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2025-03-16 21:38:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4510932105868815) internal successors, (1261), 869 states have internal predecessors, (1261), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:07,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1267 transitions. [2025-03-16 21:38:07,234 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1267 transitions. Word has length 249 [2025-03-16 21:38:07,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:07,235 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1267 transitions. [2025-03-16 21:38:07,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:07,235 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1267 transitions. [2025-03-16 21:38:07,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-16 21:38:07,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:07,236 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:07,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 21:38:07,236 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:07,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:07,236 INFO L85 PathProgramCache]: Analyzing trace with hash 596544221, now seen corresponding path program 1 times [2025-03-16 21:38:07,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:07,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211513926] [2025-03-16 21:38:07,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:07,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:07,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-16 21:38:07,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-16 21:38:07,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:07,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:07,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:07,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211513926] [2025-03-16 21:38:07,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211513926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:07,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:07,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:07,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508713601] [2025-03-16 21:38:07,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:07,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:07,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:07,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:07,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:07,933 INFO L87 Difference]: Start difference. First operand 874 states and 1267 transitions. Second operand has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:08,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:08,328 INFO L93 Difference]: Finished difference Result 1583 states and 2287 transitions. [2025-03-16 21:38:08,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:08,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 250 [2025-03-16 21:38:08,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:08,330 INFO L225 Difference]: With dead ends: 1583 [2025-03-16 21:38:08,330 INFO L226 Difference]: Without dead ends: 874 [2025-03-16 21:38:08,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:08,331 INFO L435 NwaCegarLoop]: 1018 mSDtfsCounter, 1117 mSDsluCounter, 2032 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:08,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 3050 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:38:08,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-16 21:38:08,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2025-03-16 21:38:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4499424626006905) internal successors, (1260), 869 states have internal predecessors, (1260), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1266 transitions. [2025-03-16 21:38:08,341 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1266 transitions. Word has length 250 [2025-03-16 21:38:08,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:08,341 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1266 transitions. [2025-03-16 21:38:08,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:08,341 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1266 transitions. [2025-03-16 21:38:08,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-16 21:38:08,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:08,342 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:08,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 21:38:08,342 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:08,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:08,343 INFO L85 PathProgramCache]: Analyzing trace with hash 938175900, now seen corresponding path program 1 times [2025-03-16 21:38:08,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:08,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990598214] [2025-03-16 21:38:08,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:08,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:08,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-16 21:38:08,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-16 21:38:08,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:08,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:08,789 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:08,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:08,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990598214] [2025-03-16 21:38:08,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990598214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:08,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:08,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:08,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465496338] [2025-03-16 21:38:08,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:08,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:08,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:08,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:08,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:08,791 INFO L87 Difference]: Start difference. First operand 874 states and 1266 transitions. Second operand has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:09,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:09,122 INFO L93 Difference]: Finished difference Result 1583 states and 2285 transitions. [2025-03-16 21:38:09,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:09,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 251 [2025-03-16 21:38:09,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:09,124 INFO L225 Difference]: With dead ends: 1583 [2025-03-16 21:38:09,124 INFO L226 Difference]: Without dead ends: 874 [2025-03-16 21:38:09,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:09,125 INFO L435 NwaCegarLoop]: 1018 mSDtfsCounter, 1114 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 2043 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:09,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 2043 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:09,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-16 21:38:09,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2025-03-16 21:38:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4487917146144995) internal successors, (1259), 869 states have internal predecessors, (1259), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1265 transitions. [2025-03-16 21:38:09,134 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1265 transitions. Word has length 251 [2025-03-16 21:38:09,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:09,134 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1265 transitions. [2025-03-16 21:38:09,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:09,134 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1265 transitions. [2025-03-16 21:38:09,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-16 21:38:09,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:09,135 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:09,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 21:38:09,136 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:09,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:09,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1311056361, now seen corresponding path program 1 times [2025-03-16 21:38:09,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:09,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756517226] [2025-03-16 21:38:09,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:09,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:09,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-16 21:38:09,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-16 21:38:09,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:09,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:09,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:09,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756517226] [2025-03-16 21:38:09,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756517226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:09,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:09,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:09,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854348568] [2025-03-16 21:38:09,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:09,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:09,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:09,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:09,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:09,564 INFO L87 Difference]: Start difference. First operand 874 states and 1265 transitions. Second operand has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:09,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:09,884 INFO L93 Difference]: Finished difference Result 1583 states and 2283 transitions. [2025-03-16 21:38:09,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:09,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 252 [2025-03-16 21:38:09,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:09,885 INFO L225 Difference]: With dead ends: 1583 [2025-03-16 21:38:09,885 INFO L226 Difference]: Without dead ends: 874 [2025-03-16 21:38:09,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:09,886 INFO L435 NwaCegarLoop]: 1018 mSDtfsCounter, 2218 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2218 SdHoareTripleChecker+Valid, 2037 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:09,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2218 Valid, 2037 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:09,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-16 21:38:09,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2025-03-16 21:38:09,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4476409666283083) internal successors, (1258), 869 states have internal predecessors, (1258), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1264 transitions. [2025-03-16 21:38:09,895 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1264 transitions. Word has length 252 [2025-03-16 21:38:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:09,896 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1264 transitions. [2025-03-16 21:38:09,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:09,896 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1264 transitions. [2025-03-16 21:38:09,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-16 21:38:09,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:09,897 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:09,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-16 21:38:09,897 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:09,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:09,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2068696727, now seen corresponding path program 1 times [2025-03-16 21:38:09,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:09,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065349010] [2025-03-16 21:38:09,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:09,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:09,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-16 21:38:10,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-16 21:38:10,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:10,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:10,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:10,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065349010] [2025-03-16 21:38:10,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065349010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:10,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:10,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:10,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113609593] [2025-03-16 21:38:10,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:10,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:10,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:10,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:10,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:10,373 INFO L87 Difference]: Start difference. First operand 874 states and 1264 transitions. Second operand has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:10,747 INFO L93 Difference]: Finished difference Result 1583 states and 2281 transitions. [2025-03-16 21:38:10,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:10,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 253 [2025-03-16 21:38:10,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:10,749 INFO L225 Difference]: With dead ends: 1583 [2025-03-16 21:38:10,749 INFO L226 Difference]: Without dead ends: 874 [2025-03-16 21:38:10,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:10,750 INFO L435 NwaCegarLoop]: 931 mSDtfsCounter, 1074 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:10,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 1863 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:38:10,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-16 21:38:10,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2025-03-16 21:38:10,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4464902186421174) internal successors, (1257), 869 states have internal predecessors, (1257), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1263 transitions. [2025-03-16 21:38:10,758 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1263 transitions. Word has length 253 [2025-03-16 21:38:10,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:10,758 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1263 transitions. [2025-03-16 21:38:10,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:10,758 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1263 transitions. [2025-03-16 21:38:10,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-16 21:38:10,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:10,759 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:10,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-16 21:38:10,759 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:10,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:10,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1332152727, now seen corresponding path program 1 times [2025-03-16 21:38:10,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:10,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103861763] [2025-03-16 21:38:10,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:10,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:10,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-16 21:38:10,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-16 21:38:10,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:10,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:11,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:11,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103861763] [2025-03-16 21:38:11,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103861763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:11,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:11,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:11,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002685136] [2025-03-16 21:38:11,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:11,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:11,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:11,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:11,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:11,152 INFO L87 Difference]: Start difference. First operand 874 states and 1263 transitions. Second operand has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:11,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:11,494 INFO L93 Difference]: Finished difference Result 1583 states and 2279 transitions. [2025-03-16 21:38:11,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:11,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 254 [2025-03-16 21:38:11,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:11,500 INFO L225 Difference]: With dead ends: 1583 [2025-03-16 21:38:11,500 INFO L226 Difference]: Without dead ends: 874 [2025-03-16 21:38:11,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:11,503 INFO L435 NwaCegarLoop]: 988 mSDtfsCounter, 1096 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:11,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 1983 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:11,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-16 21:38:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2025-03-16 21:38:11,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.4453394706559264) internal successors, (1256), 869 states have internal predecessors, (1256), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1262 transitions. [2025-03-16 21:38:11,530 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1262 transitions. Word has length 254 [2025-03-16 21:38:11,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:11,531 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1262 transitions. [2025-03-16 21:38:11,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1262 transitions. [2025-03-16 21:38:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-16 21:38:11,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:11,535 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:11,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-16 21:38:11,535 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:11,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:11,536 INFO L85 PathProgramCache]: Analyzing trace with hash -2092457305, now seen corresponding path program 1 times [2025-03-16 21:38:11,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:11,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808064821] [2025-03-16 21:38:11,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:11,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:11,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-16 21:38:11,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-16 21:38:11,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:11,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:12,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:12,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808064821] [2025-03-16 21:38:12,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808064821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:12,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:12,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:12,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82354159] [2025-03-16 21:38:12,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:12,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:38:12,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:12,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:38:12,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:12,039 INFO L87 Difference]: Start difference. First operand 874 states and 1262 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:12,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:12,427 INFO L93 Difference]: Finished difference Result 1585 states and 2279 transitions. [2025-03-16 21:38:12,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:12,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 255 [2025-03-16 21:38:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:12,429 INFO L225 Difference]: With dead ends: 1585 [2025-03-16 21:38:12,429 INFO L226 Difference]: Without dead ends: 874 [2025-03-16 21:38:12,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:12,429 INFO L435 NwaCegarLoop]: 1039 mSDtfsCounter, 2 mSDsluCounter, 1861 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2900 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:12,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2900 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:38:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-16 21:38:12,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2025-03-16 21:38:12,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4452133794694348) internal successors, (1253), 867 states have internal predecessors, (1253), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1259 transitions. [2025-03-16 21:38:12,437 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1259 transitions. Word has length 255 [2025-03-16 21:38:12,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:12,437 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1259 transitions. [2025-03-16 21:38:12,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:12,438 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1259 transitions. [2025-03-16 21:38:12,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-16 21:38:12,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:12,439 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:12,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-16 21:38:12,439 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:12,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:12,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1075928596, now seen corresponding path program 1 times [2025-03-16 21:38:12,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:12,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619716746] [2025-03-16 21:38:12,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:12,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:12,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-16 21:38:12,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-16 21:38:12,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:12,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:12,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:12,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619716746] [2025-03-16 21:38:12,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619716746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:12,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:12,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:12,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866786902] [2025-03-16 21:38:12,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:12,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:12,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:12,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:12,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:12,894 INFO L87 Difference]: Start difference. First operand 872 states and 1259 transitions. Second operand has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:13,210 INFO L93 Difference]: Finished difference Result 1579 states and 2271 transitions. [2025-03-16 21:38:13,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:13,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 255 [2025-03-16 21:38:13,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:13,212 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:13,212 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:13,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:13,213 INFO L435 NwaCegarLoop]: 987 mSDtfsCounter, 2176 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2176 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:13,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2176 Valid, 1975 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:13,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:13,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4440599769319493) internal successors, (1252), 867 states have internal predecessors, (1252), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1258 transitions. [2025-03-16 21:38:13,222 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1258 transitions. Word has length 255 [2025-03-16 21:38:13,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:13,222 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1258 transitions. [2025-03-16 21:38:13,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:13,222 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1258 transitions. [2025-03-16 21:38:13,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-16 21:38:13,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:13,223 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:13,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-16 21:38:13,223 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:13,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:13,224 INFO L85 PathProgramCache]: Analyzing trace with hash -843172780, now seen corresponding path program 1 times [2025-03-16 21:38:13,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:13,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393002139] [2025-03-16 21:38:13,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:13,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:13,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-16 21:38:13,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-16 21:38:13,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:13,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:13,605 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:13,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:13,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393002139] [2025-03-16 21:38:13,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393002139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:13,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:13,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:13,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281396979] [2025-03-16 21:38:13,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:13,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:13,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:13,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:13,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:13,607 INFO L87 Difference]: Start difference. First operand 872 states and 1258 transitions. Second operand has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:13,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:13,921 INFO L93 Difference]: Finished difference Result 1579 states and 2269 transitions. [2025-03-16 21:38:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:13,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 256 [2025-03-16 21:38:13,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:13,922 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:13,923 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:13,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:13,923 INFO L435 NwaCegarLoop]: 987 mSDtfsCounter, 1093 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:13,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 1981 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:13,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:13,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4429065743944636) internal successors, (1251), 867 states have internal predecessors, (1251), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1257 transitions. [2025-03-16 21:38:13,932 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1257 transitions. Word has length 256 [2025-03-16 21:38:13,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:13,932 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1257 transitions. [2025-03-16 21:38:13,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:13,932 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1257 transitions. [2025-03-16 21:38:13,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-16 21:38:13,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:13,933 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:13,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-16 21:38:13,933 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:13,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:13,933 INFO L85 PathProgramCache]: Analyzing trace with hash 448321893, now seen corresponding path program 1 times [2025-03-16 21:38:13,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:13,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561328790] [2025-03-16 21:38:13,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:13,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:13,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-16 21:38:14,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-16 21:38:14,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:14,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:14,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:14,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561328790] [2025-03-16 21:38:14,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561328790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:14,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:14,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:14,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495411850] [2025-03-16 21:38:14,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:14,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:14,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:14,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:14,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:14,458 INFO L87 Difference]: Start difference. First operand 872 states and 1257 transitions. Second operand has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:14,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:14,780 INFO L93 Difference]: Finished difference Result 1579 states and 2267 transitions. [2025-03-16 21:38:14,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:14,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 257 [2025-03-16 21:38:14,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:14,782 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:14,782 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:14,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:14,783 INFO L435 NwaCegarLoop]: 987 mSDtfsCounter, 1092 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:14,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 1981 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:14,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:14,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.441753171856978) internal successors, (1250), 867 states have internal predecessors, (1250), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1256 transitions. [2025-03-16 21:38:14,792 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1256 transitions. Word has length 257 [2025-03-16 21:38:14,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:14,793 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1256 transitions. [2025-03-16 21:38:14,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:14,793 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1256 transitions. [2025-03-16 21:38:14,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-16 21:38:14,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:14,794 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:14,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-16 21:38:14,794 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:14,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:14,795 INFO L85 PathProgramCache]: Analyzing trace with hash 764007704, now seen corresponding path program 1 times [2025-03-16 21:38:14,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:14,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399445322] [2025-03-16 21:38:14,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:14,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:14,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-16 21:38:14,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-16 21:38:14,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:14,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:15,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:15,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399445322] [2025-03-16 21:38:15,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399445322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:15,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:15,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:15,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056222404] [2025-03-16 21:38:15,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:15,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:15,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:15,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:15,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:15,215 INFO L87 Difference]: Start difference. First operand 872 states and 1256 transitions. Second operand has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:15,607 INFO L93 Difference]: Finished difference Result 1579 states and 2265 transitions. [2025-03-16 21:38:15,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:15,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 258 [2025-03-16 21:38:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:15,610 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:15,610 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:15,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:15,611 INFO L435 NwaCegarLoop]: 987 mSDtfsCounter, 2158 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2158 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:15,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2158 Valid, 1975 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:38:15,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:15,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:15,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4405997693194925) internal successors, (1249), 867 states have internal predecessors, (1249), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:15,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1255 transitions. [2025-03-16 21:38:15,625 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1255 transitions. Word has length 258 [2025-03-16 21:38:15,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:15,625 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1255 transitions. [2025-03-16 21:38:15,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:15,625 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1255 transitions. [2025-03-16 21:38:15,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-16 21:38:15,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:15,627 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:15,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-16 21:38:15,627 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:15,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:15,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2138909206, now seen corresponding path program 1 times [2025-03-16 21:38:15,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:15,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649236481] [2025-03-16 21:38:15,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:15,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:15,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-16 21:38:15,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-16 21:38:15,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:15,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:16,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:16,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649236481] [2025-03-16 21:38:16,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649236481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:16,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:16,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:16,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391129764] [2025-03-16 21:38:16,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:16,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:16,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:16,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:16,033 INFO L87 Difference]: Start difference. First operand 872 states and 1255 transitions. Second operand has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:16,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:16,421 INFO L93 Difference]: Finished difference Result 1579 states and 2263 transitions. [2025-03-16 21:38:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:16,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 259 [2025-03-16 21:38:16,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:16,426 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:16,426 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:16,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:16,427 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 1059 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:16,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1857 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:38:16,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:16,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:16,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.439446366782007) internal successors, (1248), 867 states have internal predecessors, (1248), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1254 transitions. [2025-03-16 21:38:16,436 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1254 transitions. Word has length 259 [2025-03-16 21:38:16,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:16,436 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1254 transitions. [2025-03-16 21:38:16,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:16,436 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1254 transitions. [2025-03-16 21:38:16,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-16 21:38:16,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:16,437 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:16,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-16 21:38:16,437 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:16,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:16,438 INFO L85 PathProgramCache]: Analyzing trace with hash 623684003, now seen corresponding path program 1 times [2025-03-16 21:38:16,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:16,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969468025] [2025-03-16 21:38:16,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:16,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:16,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-16 21:38:16,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-16 21:38:16,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:16,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:16,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:16,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969468025] [2025-03-16 21:38:16,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969468025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:16,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:16,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:16,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194327987] [2025-03-16 21:38:16,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:16,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:16,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:16,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:16,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:16,954 INFO L87 Difference]: Start difference. First operand 872 states and 1254 transitions. Second operand has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:17,344 INFO L93 Difference]: Finished difference Result 1579 states and 2261 transitions. [2025-03-16 21:38:17,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:17,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 260 [2025-03-16 21:38:17,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:17,346 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:17,346 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:17,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:17,347 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 2108 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2108 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:17,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2108 Valid, 1851 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:38:17,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:17,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4382929642445212) internal successors, (1247), 867 states have internal predecessors, (1247), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1253 transitions. [2025-03-16 21:38:17,356 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1253 transitions. Word has length 260 [2025-03-16 21:38:17,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:17,356 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1253 transitions. [2025-03-16 21:38:17,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:17,356 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1253 transitions. [2025-03-16 21:38:17,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-16 21:38:17,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:17,357 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:17,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-16 21:38:17,357 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:17,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:17,358 INFO L85 PathProgramCache]: Analyzing trace with hash -708915648, now seen corresponding path program 1 times [2025-03-16 21:38:17,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:17,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992173664] [2025-03-16 21:38:17,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:17,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:17,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-16 21:38:17,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-16 21:38:17,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:17,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:17,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:17,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992173664] [2025-03-16 21:38:17,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992173664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:17,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:17,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:17,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424935775] [2025-03-16 21:38:17,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:17,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:17,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:17,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:17,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:17,778 INFO L87 Difference]: Start difference. First operand 872 states and 1253 transitions. Second operand has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:18,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:18,142 INFO L93 Difference]: Finished difference Result 1579 states and 2259 transitions. [2025-03-16 21:38:18,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:18,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 261 [2025-03-16 21:38:18,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:18,144 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:18,145 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:18,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:18,145 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 1057 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:18,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 1857 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:18,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:18,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4371395617070357) internal successors, (1246), 867 states have internal predecessors, (1246), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:18,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1252 transitions. [2025-03-16 21:38:18,154 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1252 transitions. Word has length 261 [2025-03-16 21:38:18,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:18,155 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1252 transitions. [2025-03-16 21:38:18,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1252 transitions. [2025-03-16 21:38:18,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-16 21:38:18,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:18,156 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:18,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-16 21:38:18,156 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:18,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:18,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1477406252, now seen corresponding path program 1 times [2025-03-16 21:38:18,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:18,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623645327] [2025-03-16 21:38:18,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:18,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:18,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-16 21:38:18,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-16 21:38:18,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:18,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:18,735 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:18,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:18,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623645327] [2025-03-16 21:38:18,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623645327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:18,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:18,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:18,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013508142] [2025-03-16 21:38:18,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:18,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:18,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:18,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:18,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:18,736 INFO L87 Difference]: Start difference. First operand 872 states and 1252 transitions. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:19,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:19,096 INFO L93 Difference]: Finished difference Result 1579 states and 2257 transitions. [2025-03-16 21:38:19,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:19,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 262 [2025-03-16 21:38:19,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:19,098 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:19,098 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:19,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:19,099 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 1056 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:19,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 1857 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:19,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4359861591695502) internal successors, (1245), 867 states have internal predecessors, (1245), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1251 transitions. [2025-03-16 21:38:19,107 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1251 transitions. Word has length 262 [2025-03-16 21:38:19,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:19,107 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1251 transitions. [2025-03-16 21:38:19,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1251 transitions. [2025-03-16 21:38:19,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-16 21:38:19,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:19,108 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:19,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-16 21:38:19,108 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:19,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:19,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1508196524, now seen corresponding path program 1 times [2025-03-16 21:38:19,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:19,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062088293] [2025-03-16 21:38:19,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:19,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:19,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-16 21:38:19,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-16 21:38:19,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:19,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:19,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:19,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062088293] [2025-03-16 21:38:19,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062088293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:19,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:19,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:19,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136011223] [2025-03-16 21:38:19,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:19,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:19,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:19,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:19,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:19,545 INFO L87 Difference]: Start difference. First operand 872 states and 1251 transitions. Second operand has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:19,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:19,915 INFO L93 Difference]: Finished difference Result 1579 states and 2255 transitions. [2025-03-16 21:38:19,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:19,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 263 [2025-03-16 21:38:19,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:19,917 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:19,917 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:19,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:19,918 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 2090 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2090 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:19,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2090 Valid, 1851 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:19,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:19,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4348327566320647) internal successors, (1244), 867 states have internal predecessors, (1244), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1250 transitions. [2025-03-16 21:38:19,926 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1250 transitions. Word has length 263 [2025-03-16 21:38:19,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:19,926 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1250 transitions. [2025-03-16 21:38:19,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1250 transitions. [2025-03-16 21:38:19,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-16 21:38:19,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:19,927 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:19,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-16 21:38:19,927 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:19,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:19,928 INFO L85 PathProgramCache]: Analyzing trace with hash 241666845, now seen corresponding path program 1 times [2025-03-16 21:38:19,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:19,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671506665] [2025-03-16 21:38:19,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:19,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:19,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-16 21:38:20,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-16 21:38:20,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:20,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:20,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:20,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671506665] [2025-03-16 21:38:20,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671506665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:20,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:20,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:20,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358654784] [2025-03-16 21:38:20,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:20,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:20,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:20,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:20,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:20,326 INFO L87 Difference]: Start difference. First operand 872 states and 1250 transitions. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:20,698 INFO L93 Difference]: Finished difference Result 1579 states and 2253 transitions. [2025-03-16 21:38:20,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:20,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 264 [2025-03-16 21:38:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:20,699 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:20,699 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:20,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:20,700 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 2084 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2084 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:20,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2084 Valid, 1851 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:20,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:20,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.433679354094579) internal successors, (1243), 867 states have internal predecessors, (1243), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:20,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1249 transitions. [2025-03-16 21:38:20,710 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1249 transitions. Word has length 264 [2025-03-16 21:38:20,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:20,710 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1249 transitions. [2025-03-16 21:38:20,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:20,710 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1249 transitions. [2025-03-16 21:38:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-16 21:38:20,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:20,711 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:20,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-16 21:38:20,711 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:20,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:20,711 INFO L85 PathProgramCache]: Analyzing trace with hash 482129244, now seen corresponding path program 1 times [2025-03-16 21:38:20,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:20,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389948636] [2025-03-16 21:38:20,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:20,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:20,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-16 21:38:20,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-16 21:38:20,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:20,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:21,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:21,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389948636] [2025-03-16 21:38:21,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389948636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:21,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:21,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:21,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778507147] [2025-03-16 21:38:21,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:21,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:21,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:21,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:21,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:21,203 INFO L87 Difference]: Start difference. First operand 872 states and 1249 transitions. Second operand has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:21,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:21,582 INFO L93 Difference]: Finished difference Result 1579 states and 2251 transitions. [2025-03-16 21:38:21,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:21,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 265 [2025-03-16 21:38:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:21,584 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:21,584 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:21,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:21,584 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 2078 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2078 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:21,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2078 Valid, 1851 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:21,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4325259515570934) internal successors, (1242), 867 states have internal predecessors, (1242), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1248 transitions. [2025-03-16 21:38:21,593 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1248 transitions. Word has length 265 [2025-03-16 21:38:21,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:21,594 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1248 transitions. [2025-03-16 21:38:21,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1248 transitions. [2025-03-16 21:38:21,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-16 21:38:21,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:21,595 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:21,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-16 21:38:21,595 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:21,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:21,596 INFO L85 PathProgramCache]: Analyzing trace with hash -819861858, now seen corresponding path program 1 times [2025-03-16 21:38:21,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:21,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220537657] [2025-03-16 21:38:21,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:21,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:21,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-16 21:38:21,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-16 21:38:21,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:21,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:21,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220537657] [2025-03-16 21:38:21,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220537657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:21,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:21,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:21,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296846399] [2025-03-16 21:38:21,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:21,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:21,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:21,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:21,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:21,975 INFO L87 Difference]: Start difference. First operand 872 states and 1248 transitions. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:22,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:22,348 INFO L93 Difference]: Finished difference Result 1579 states and 2249 transitions. [2025-03-16 21:38:22,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:22,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 266 [2025-03-16 21:38:22,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:22,350 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:22,350 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:22,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:22,350 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 2072 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2072 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:22,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2072 Valid, 1851 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:22,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:22,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:22,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4313725490196079) internal successors, (1241), 867 states have internal predecessors, (1241), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1247 transitions. [2025-03-16 21:38:22,359 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1247 transitions. Word has length 266 [2025-03-16 21:38:22,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:22,359 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1247 transitions. [2025-03-16 21:38:22,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:22,360 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1247 transitions. [2025-03-16 21:38:22,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-16 21:38:22,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:22,360 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:22,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-16 21:38:22,361 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:22,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:22,361 INFO L85 PathProgramCache]: Analyzing trace with hash 185283416, now seen corresponding path program 1 times [2025-03-16 21:38:22,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:22,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589709351] [2025-03-16 21:38:22,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:22,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:22,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-16 21:38:22,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-16 21:38:22,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:22,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:22,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:22,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:22,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589709351] [2025-03-16 21:38:22,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589709351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:22,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:22,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:22,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966872646] [2025-03-16 21:38:22,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:22,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:22,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:22,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:22,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:22,769 INFO L87 Difference]: Start difference. First operand 872 states and 1247 transitions. Second operand has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:23,127 INFO L93 Difference]: Finished difference Result 1579 states and 2247 transitions. [2025-03-16 21:38:23,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:23,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 267 [2025-03-16 21:38:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:23,128 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:23,128 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:23,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:23,129 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 2066 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2066 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:23,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2066 Valid, 1851 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:23,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4302191464821223) internal successors, (1240), 867 states have internal predecessors, (1240), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:23,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1246 transitions. [2025-03-16 21:38:23,139 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1246 transitions. Word has length 267 [2025-03-16 21:38:23,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:23,139 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1246 transitions. [2025-03-16 21:38:23,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:23,140 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1246 transitions. [2025-03-16 21:38:23,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-16 21:38:23,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:23,141 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:23,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-16 21:38:23,141 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:23,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:23,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1361828309, now seen corresponding path program 1 times [2025-03-16 21:38:23,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:23,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541755843] [2025-03-16 21:38:23,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:23,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:23,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-16 21:38:23,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-16 21:38:23,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:23,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:23,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:23,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541755843] [2025-03-16 21:38:23,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541755843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:23,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:23,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:23,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288523444] [2025-03-16 21:38:23,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:23,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:23,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:23,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:23,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:23,571 INFO L87 Difference]: Start difference. First operand 872 states and 1246 transitions. Second operand has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:23,950 INFO L93 Difference]: Finished difference Result 1579 states and 2245 transitions. [2025-03-16 21:38:23,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:23,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 268 [2025-03-16 21:38:23,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:23,951 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:23,951 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:23,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:23,952 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 1050 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:23,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 1857 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:23,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4290657439446366) internal successors, (1239), 867 states have internal predecessors, (1239), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1245 transitions. [2025-03-16 21:38:23,961 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1245 transitions. Word has length 268 [2025-03-16 21:38:23,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:23,961 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1245 transitions. [2025-03-16 21:38:23,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1245 transitions. [2025-03-16 21:38:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-16 21:38:23,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:23,963 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:23,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-16 21:38:23,963 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:23,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:23,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1104194878, now seen corresponding path program 1 times [2025-03-16 21:38:23,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:23,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547267877] [2025-03-16 21:38:23,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:23,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:24,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-16 21:38:24,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-16 21:38:24,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:24,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:24,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:24,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547267877] [2025-03-16 21:38:24,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547267877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:24,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:24,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:24,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330156331] [2025-03-16 21:38:24,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:24,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:24,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:24,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:24,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:24,362 INFO L87 Difference]: Start difference. First operand 872 states and 1245 transitions. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:24,726 INFO L93 Difference]: Finished difference Result 1579 states and 2243 transitions. [2025-03-16 21:38:24,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:24,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 269 [2025-03-16 21:38:24,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:24,728 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:24,728 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:24,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:24,729 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 1049 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:24,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 1857 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:24,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:24,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.427912341407151) internal successors, (1238), 867 states have internal predecessors, (1238), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:24,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1244 transitions. [2025-03-16 21:38:24,740 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1244 transitions. Word has length 269 [2025-03-16 21:38:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:24,740 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1244 transitions. [2025-03-16 21:38:24,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:24,740 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1244 transitions. [2025-03-16 21:38:24,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-16 21:38:24,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:24,741 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:24,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-16 21:38:24,741 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:24,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:24,742 INFO L85 PathProgramCache]: Analyzing trace with hash 726023861, now seen corresponding path program 1 times [2025-03-16 21:38:24,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:24,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607900546] [2025-03-16 21:38:24,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:24,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:24,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-16 21:38:24,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-16 21:38:24,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:24,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:25,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:25,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607900546] [2025-03-16 21:38:25,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607900546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:25,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:25,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:25,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085542706] [2025-03-16 21:38:25,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:25,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:25,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:25,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:25,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:25,168 INFO L87 Difference]: Start difference. First operand 872 states and 1244 transitions. Second operand has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:25,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:25,527 INFO L93 Difference]: Finished difference Result 1579 states and 2241 transitions. [2025-03-16 21:38:25,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:25,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 270 [2025-03-16 21:38:25,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:25,529 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:25,529 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:25,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:25,530 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 1048 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:25,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1857 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:25,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:25,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:25,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4267589388696655) internal successors, (1237), 867 states have internal predecessors, (1237), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1243 transitions. [2025-03-16 21:38:25,540 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1243 transitions. Word has length 270 [2025-03-16 21:38:25,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:25,541 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1243 transitions. [2025-03-16 21:38:25,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1243 transitions. [2025-03-16 21:38:25,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-16 21:38:25,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:25,542 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:25,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-16 21:38:25,542 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:25,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:25,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1198499013, now seen corresponding path program 1 times [2025-03-16 21:38:25,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:25,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291317801] [2025-03-16 21:38:25,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:25,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:25,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-16 21:38:25,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-16 21:38:25,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:25,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:25,919 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:25,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:25,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291317801] [2025-03-16 21:38:25,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291317801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:25,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:25,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:25,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126821551] [2025-03-16 21:38:25,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:25,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:25,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:25,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:25,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:25,920 INFO L87 Difference]: Start difference. First operand 872 states and 1243 transitions. Second operand has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:26,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:26,277 INFO L93 Difference]: Finished difference Result 1579 states and 2239 transitions. [2025-03-16 21:38:26,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:26,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 271 [2025-03-16 21:38:26,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:26,278 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:26,279 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:26,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:26,279 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 1047 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:26,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 1857 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:26,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:26,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.42560553633218) internal successors, (1236), 867 states have internal predecessors, (1236), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:26,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1242 transitions. [2025-03-16 21:38:26,288 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1242 transitions. Word has length 271 [2025-03-16 21:38:26,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:26,288 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1242 transitions. [2025-03-16 21:38:26,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1242 transitions. [2025-03-16 21:38:26,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-16 21:38:26,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:26,289 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:26,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-16 21:38:26,289 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:26,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:26,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1344463769, now seen corresponding path program 1 times [2025-03-16 21:38:26,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:26,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847055025] [2025-03-16 21:38:26,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:26,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:26,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-16 21:38:26,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-16 21:38:26,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:26,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:26,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:26,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847055025] [2025-03-16 21:38:26,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847055025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:26,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:26,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:26,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158353353] [2025-03-16 21:38:26,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:26,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:26,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:26,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:26,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:26,732 INFO L87 Difference]: Start difference. First operand 872 states and 1242 transitions. Second operand has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:27,119 INFO L93 Difference]: Finished difference Result 1579 states and 2237 transitions. [2025-03-16 21:38:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:27,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 272 [2025-03-16 21:38:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:27,120 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:27,120 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:27,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:27,121 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 1046 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:27,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 1857 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:27,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:27,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4244521337946943) internal successors, (1235), 867 states have internal predecessors, (1235), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1241 transitions. [2025-03-16 21:38:27,135 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1241 transitions. Word has length 272 [2025-03-16 21:38:27,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:27,135 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1241 transitions. [2025-03-16 21:38:27,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:27,135 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1241 transitions. [2025-03-16 21:38:27,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-16 21:38:27,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:27,137 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:27,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-16 21:38:27,137 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:27,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:27,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1981542090, now seen corresponding path program 1 times [2025-03-16 21:38:27,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:27,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41010324] [2025-03-16 21:38:27,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:27,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:27,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-16 21:38:27,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-16 21:38:27,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:27,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:27,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:27,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:27,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41010324] [2025-03-16 21:38:27,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41010324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:27,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:27,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:27,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443127544] [2025-03-16 21:38:27,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:27,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:38:27,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:27,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:38:27,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:27,407 INFO L87 Difference]: Start difference. First operand 872 states and 1241 transitions. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:38:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:27,658 INFO L93 Difference]: Finished difference Result 1579 states and 2235 transitions. [2025-03-16 21:38:27,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:27,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 273 [2025-03-16 21:38:27,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:27,659 INFO L225 Difference]: With dead ends: 1579 [2025-03-16 21:38:27,659 INFO L226 Difference]: Without dead ends: 872 [2025-03-16 21:38:27,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:27,660 INFO L435 NwaCegarLoop]: 1012 mSDtfsCounter, 1138 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 2025 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:27,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 2025 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:27,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-16 21:38:27,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-16 21:38:27,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4232987312572087) internal successors, (1234), 867 states have internal predecessors, (1234), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:27,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1240 transitions. [2025-03-16 21:38:27,669 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1240 transitions. Word has length 273 [2025-03-16 21:38:27,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:27,669 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1240 transitions. [2025-03-16 21:38:27,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:38:27,669 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1240 transitions. [2025-03-16 21:38:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-16 21:38:27,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:27,670 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:27,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-03-16 21:38:27,670 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:27,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash -455196212, now seen corresponding path program 1 times [2025-03-16 21:38:27,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:27,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898414554] [2025-03-16 21:38:27,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:27,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:27,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-16 21:38:27,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-16 21:38:27,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:27,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:28,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:28,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898414554] [2025-03-16 21:38:28,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898414554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:28,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:28,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:38:28,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592704900] [2025-03-16 21:38:28,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:28,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:38:28,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:28,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:38:28,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:38:28,162 INFO L87 Difference]: Start difference. First operand 872 states and 1240 transitions. Second operand has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:28,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:28,754 INFO L93 Difference]: Finished difference Result 1643 states and 2326 transitions. [2025-03-16 21:38:28,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:38:28,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 274 [2025-03-16 21:38:28,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:28,755 INFO L225 Difference]: With dead ends: 1643 [2025-03-16 21:38:28,756 INFO L226 Difference]: Without dead ends: 876 [2025-03-16 21:38:28,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-16 21:38:28,757 INFO L435 NwaCegarLoop]: 1016 mSDtfsCounter, 1252 mSDsluCounter, 3846 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 4862 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:28,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 4862 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:38:28,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-03-16 21:38:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 874. [2025-03-16 21:38:28,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 869 states have (on average 1.421173762945915) internal successors, (1235), 869 states have internal predecessors, (1235), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:38:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1241 transitions. [2025-03-16 21:38:28,767 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1241 transitions. Word has length 274 [2025-03-16 21:38:28,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:28,767 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1241 transitions. [2025-03-16 21:38:28,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:28,767 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1241 transitions. [2025-03-16 21:38:28,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-16 21:38:28,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:28,768 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:28,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-03-16 21:38:28,768 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:28,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:28,769 INFO L85 PathProgramCache]: Analyzing trace with hash 601447500, now seen corresponding path program 1 times [2025-03-16 21:38:28,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:28,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008547025] [2025-03-16 21:38:28,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:28,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:28,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-16 21:38:28,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-16 21:38:28,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:28,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:38:29,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:29,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008547025] [2025-03-16 21:38:29,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008547025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:29,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:29,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:38:29,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765716907] [2025-03-16 21:38:29,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:29,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:38:29,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:29,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:38:29,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:29,642 INFO L87 Difference]: Start difference. First operand 874 states and 1241 transitions. Second operand has 6 states, 6 states have (on average 43.833333333333336) internal successors, (263), 6 states have internal predecessors, (263), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:30,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:30,141 INFO L93 Difference]: Finished difference Result 1801 states and 2500 transitions. [2025-03-16 21:38:30,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:38:30,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 43.833333333333336) internal successors, (263), 6 states have internal predecessors, (263), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 275 [2025-03-16 21:38:30,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:30,143 INFO L225 Difference]: With dead ends: 1801 [2025-03-16 21:38:30,143 INFO L226 Difference]: Without dead ends: 1092 [2025-03-16 21:38:30,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:38:30,144 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 1680 mSDsluCounter, 3024 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 4034 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:30,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1683 Valid, 4034 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:38:30,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-03-16 21:38:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1092. [2025-03-16 21:38:30,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1084 states have (on average 1.3773062730627306) internal successors, (1493), 1084 states have internal predecessors, (1493), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:30,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1505 transitions. [2025-03-16 21:38:30,165 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1505 transitions. Word has length 275 [2025-03-16 21:38:30,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:30,165 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1505 transitions. [2025-03-16 21:38:30,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.833333333333336) internal successors, (263), 6 states have internal predecessors, (263), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:38:30,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1505 transitions. [2025-03-16 21:38:30,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2025-03-16 21:38:30,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:30,168 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:30,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-03-16 21:38:30,169 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:30,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:30,169 INFO L85 PathProgramCache]: Analyzing trace with hash -2021810706, now seen corresponding path program 1 times [2025-03-16 21:38:30,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:30,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744369377] [2025-03-16 21:38:30,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:30,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:30,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 701 statements into 1 equivalence classes. [2025-03-16 21:38:30,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 701 of 701 statements. [2025-03-16 21:38:30,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:30,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:31,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:31,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744369377] [2025-03-16 21:38:31,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744369377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:31,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:31,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:31,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090205836] [2025-03-16 21:38:31,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:31,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:31,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:31,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:31,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:31,128 INFO L87 Difference]: Start difference. First operand 1092 states and 1505 transitions. Second operand has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:31,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:31,457 INFO L93 Difference]: Finished difference Result 1801 states and 2499 transitions. [2025-03-16 21:38:31,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:31,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 701 [2025-03-16 21:38:31,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:31,458 INFO L225 Difference]: With dead ends: 1801 [2025-03-16 21:38:31,458 INFO L226 Difference]: Without dead ends: 1092 [2025-03-16 21:38:31,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:31,459 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 1140 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:31,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 1853 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:31,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-03-16 21:38:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1092. [2025-03-16 21:38:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1084 states have (on average 1.3763837638376384) internal successors, (1492), 1084 states have internal predecessors, (1492), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1504 transitions. [2025-03-16 21:38:31,473 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1504 transitions. Word has length 701 [2025-03-16 21:38:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:31,473 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1504 transitions. [2025-03-16 21:38:31,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1504 transitions. [2025-03-16 21:38:31,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-03-16 21:38:31,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:31,476 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:31,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-03-16 21:38:31,476 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:31,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:31,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1381661096, now seen corresponding path program 1 times [2025-03-16 21:38:31,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:31,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365494923] [2025-03-16 21:38:31,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:31,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:31,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-03-16 21:38:31,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-03-16 21:38:31,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:31,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:32,281 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:32,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:32,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365494923] [2025-03-16 21:38:32,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365494923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:32,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:32,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:32,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097790217] [2025-03-16 21:38:32,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:32,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:32,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:32,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:32,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:32,283 INFO L87 Difference]: Start difference. First operand 1092 states and 1504 transitions. Second operand has 5 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:32,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:32,634 INFO L93 Difference]: Finished difference Result 1801 states and 2497 transitions. [2025-03-16 21:38:32,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:32,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 702 [2025-03-16 21:38:32,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:32,635 INFO L225 Difference]: With dead ends: 1801 [2025-03-16 21:38:32,635 INFO L226 Difference]: Without dead ends: 1092 [2025-03-16 21:38:32,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:32,636 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 2078 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2081 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:32,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2081 Valid, 1847 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:32,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-03-16 21:38:32,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1092. [2025-03-16 21:38:32,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1084 states have (on average 1.3754612546125462) internal successors, (1491), 1084 states have internal predecessors, (1491), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1503 transitions. [2025-03-16 21:38:32,650 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1503 transitions. Word has length 702 [2025-03-16 21:38:32,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:32,651 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1503 transitions. [2025-03-16 21:38:32,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:32,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1503 transitions. [2025-03-16 21:38:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2025-03-16 21:38:32,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:32,677 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:32,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-03-16 21:38:32,678 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:32,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:32,679 INFO L85 PathProgramCache]: Analyzing trace with hash -8205185, now seen corresponding path program 1 times [2025-03-16 21:38:32,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:32,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001878656] [2025-03-16 21:38:32,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:32,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:32,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 703 statements into 1 equivalence classes. [2025-03-16 21:38:32,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 703 of 703 statements. [2025-03-16 21:38:32,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:32,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:33,490 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:33,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:33,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001878656] [2025-03-16 21:38:33,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001878656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:33,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:33,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:33,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142622308] [2025-03-16 21:38:33,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:33,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:33,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:33,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:33,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:33,491 INFO L87 Difference]: Start difference. First operand 1092 states and 1503 transitions. Second operand has 5 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:33,799 INFO L93 Difference]: Finished difference Result 1801 states and 2495 transitions. [2025-03-16 21:38:33,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:33,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 703 [2025-03-16 21:38:33,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:33,800 INFO L225 Difference]: With dead ends: 1801 [2025-03-16 21:38:33,800 INFO L226 Difference]: Without dead ends: 1092 [2025-03-16 21:38:33,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:33,801 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 2062 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2065 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:33,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2065 Valid, 1847 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:33,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-03-16 21:38:33,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1092. [2025-03-16 21:38:33,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1084 states have (on average 1.3745387453874538) internal successors, (1490), 1084 states have internal predecessors, (1490), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:33,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1502 transitions. [2025-03-16 21:38:33,816 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1502 transitions. Word has length 703 [2025-03-16 21:38:33,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:33,816 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1502 transitions. [2025-03-16 21:38:33,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:33,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1502 transitions. [2025-03-16 21:38:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2025-03-16 21:38:33,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:33,820 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:33,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-03-16 21:38:33,820 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:33,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:33,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1241867111, now seen corresponding path program 1 times [2025-03-16 21:38:33,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:33,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432765056] [2025-03-16 21:38:33,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:33,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:33,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 704 statements into 1 equivalence classes. [2025-03-16 21:38:34,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 704 of 704 statements. [2025-03-16 21:38:34,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:34,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:34,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:34,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432765056] [2025-03-16 21:38:34,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432765056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:34,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:34,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:34,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826448848] [2025-03-16 21:38:34,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:34,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:34,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:34,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:34,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:34,750 INFO L87 Difference]: Start difference. First operand 1092 states and 1502 transitions. Second operand has 5 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:35,090 INFO L93 Difference]: Finished difference Result 1801 states and 2493 transitions. [2025-03-16 21:38:35,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:35,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 704 [2025-03-16 21:38:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:35,092 INFO L225 Difference]: With dead ends: 1801 [2025-03-16 21:38:35,092 INFO L226 Difference]: Without dead ends: 1092 [2025-03-16 21:38:35,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:35,093 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 2046 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2049 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:35,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2049 Valid, 1847 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:35,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-03-16 21:38:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1092. [2025-03-16 21:38:35,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1084 states have (on average 1.3736162361623616) internal successors, (1489), 1084 states have internal predecessors, (1489), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1501 transitions. [2025-03-16 21:38:35,117 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1501 transitions. Word has length 704 [2025-03-16 21:38:35,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:35,117 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1501 transitions. [2025-03-16 21:38:35,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:35,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1501 transitions. [2025-03-16 21:38:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-03-16 21:38:35,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:35,124 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:35,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-03-16 21:38:35,124 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:35,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:35,125 INFO L85 PathProgramCache]: Analyzing trace with hash 46807184, now seen corresponding path program 1 times [2025-03-16 21:38:35,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:35,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371834892] [2025-03-16 21:38:35,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:35,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:35,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-03-16 21:38:35,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-03-16 21:38:35,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:35,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:35,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:35,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371834892] [2025-03-16 21:38:35,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371834892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:35,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:35,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:35,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63920658] [2025-03-16 21:38:35,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:35,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:35,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:36,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:36,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:36,000 INFO L87 Difference]: Start difference. First operand 1092 states and 1501 transitions. Second operand has 5 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:36,316 INFO L93 Difference]: Finished difference Result 1801 states and 2491 transitions. [2025-03-16 21:38:36,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:36,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 705 [2025-03-16 21:38:36,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:36,317 INFO L225 Difference]: With dead ends: 1801 [2025-03-16 21:38:36,317 INFO L226 Difference]: Without dead ends: 1092 [2025-03-16 21:38:36,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:36,318 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 2030 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2033 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:36,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2033 Valid, 1847 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-03-16 21:38:36,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1092. [2025-03-16 21:38:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1084 states have (on average 1.3726937269372694) internal successors, (1488), 1084 states have internal predecessors, (1488), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1500 transitions. [2025-03-16 21:38:36,333 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1500 transitions. Word has length 705 [2025-03-16 21:38:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:36,333 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1500 transitions. [2025-03-16 21:38:36,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1500 transitions. [2025-03-16 21:38:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-03-16 21:38:36,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:36,336 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:36,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-03-16 21:38:36,337 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:36,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:36,337 INFO L85 PathProgramCache]: Analyzing trace with hash 23770378, now seen corresponding path program 1 times [2025-03-16 21:38:36,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:36,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109966056] [2025-03-16 21:38:36,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:36,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:36,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-03-16 21:38:36,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-03-16 21:38:36,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:36,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:37,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:37,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109966056] [2025-03-16 21:38:37,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109966056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:37,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:37,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:37,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81452336] [2025-03-16 21:38:37,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:37,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:37,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:37,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:37,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:37,158 INFO L87 Difference]: Start difference. First operand 1092 states and 1500 transitions. Second operand has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:37,475 INFO L93 Difference]: Finished difference Result 1801 states and 2489 transitions. [2025-03-16 21:38:37,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:37,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 706 [2025-03-16 21:38:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:37,476 INFO L225 Difference]: With dead ends: 1801 [2025-03-16 21:38:37,476 INFO L226 Difference]: Without dead ends: 1092 [2025-03-16 21:38:37,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:37,477 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 2014 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:37,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 1847 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:37,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-03-16 21:38:37,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1092. [2025-03-16 21:38:37,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1084 states have (on average 1.371771217712177) internal successors, (1487), 1084 states have internal predecessors, (1487), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:37,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1499 transitions. [2025-03-16 21:38:37,490 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1499 transitions. Word has length 706 [2025-03-16 21:38:37,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:37,490 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1499 transitions. [2025-03-16 21:38:37,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1499 transitions. [2025-03-16 21:38:37,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2025-03-16 21:38:37,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:37,493 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:37,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-03-16 21:38:37,493 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:37,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:37,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1578556895, now seen corresponding path program 1 times [2025-03-16 21:38:37,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:37,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70758570] [2025-03-16 21:38:37,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:37,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:37,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-03-16 21:38:37,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-03-16 21:38:37,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:37,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:38,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:38,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70758570] [2025-03-16 21:38:38,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70758570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:38,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:38,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:38,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536625398] [2025-03-16 21:38:38,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:38,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:38,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:38,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:38,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:38,318 INFO L87 Difference]: Start difference. First operand 1092 states and 1499 transitions. Second operand has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:38,662 INFO L93 Difference]: Finished difference Result 1801 states and 2487 transitions. [2025-03-16 21:38:38,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:38,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 707 [2025-03-16 21:38:38,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:38,664 INFO L225 Difference]: With dead ends: 1801 [2025-03-16 21:38:38,664 INFO L226 Difference]: Without dead ends: 1092 [2025-03-16 21:38:38,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:38,665 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 1998 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2001 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:38,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2001 Valid, 1847 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:38,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-03-16 21:38:38,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1092. [2025-03-16 21:38:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1084 states have (on average 1.3708487084870848) internal successors, (1486), 1084 states have internal predecessors, (1486), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:38,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1498 transitions. [2025-03-16 21:38:38,677 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1498 transitions. Word has length 707 [2025-03-16 21:38:38,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:38,677 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1498 transitions. [2025-03-16 21:38:38,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:38,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1498 transitions. [2025-03-16 21:38:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2025-03-16 21:38:38,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:38,681 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:38,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-03-16 21:38:38,681 INFO L396 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:38,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:38,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1210712827, now seen corresponding path program 1 times [2025-03-16 21:38:38,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:38,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338188187] [2025-03-16 21:38:38,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:38,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:38,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 708 statements into 1 equivalence classes. [2025-03-16 21:38:38,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 708 of 708 statements. [2025-03-16 21:38:38,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:38,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:39,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:39,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338188187] [2025-03-16 21:38:39,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338188187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:39,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:39,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:39,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828314521] [2025-03-16 21:38:39,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:39,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:39,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:39,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:39,557 INFO L87 Difference]: Start difference. First operand 1092 states and 1498 transitions. Second operand has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:39,894 INFO L93 Difference]: Finished difference Result 1801 states and 2485 transitions. [2025-03-16 21:38:39,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:39,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 708 [2025-03-16 21:38:39,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:39,896 INFO L225 Difference]: With dead ends: 1801 [2025-03-16 21:38:39,896 INFO L226 Difference]: Without dead ends: 1092 [2025-03-16 21:38:39,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:39,896 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 1982 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1985 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:39,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1985 Valid, 1847 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:39,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-03-16 21:38:39,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1092. [2025-03-16 21:38:39,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1084 states have (on average 1.3699261992619927) internal successors, (1485), 1084 states have internal predecessors, (1485), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1497 transitions. [2025-03-16 21:38:39,920 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1497 transitions. Word has length 708 [2025-03-16 21:38:39,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:39,921 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1497 transitions. [2025-03-16 21:38:39,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1497 transitions. [2025-03-16 21:38:39,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-03-16 21:38:39,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:39,927 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:39,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-03-16 21:38:39,928 INFO L396 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:39,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:39,928 INFO L85 PathProgramCache]: Analyzing trace with hash -166409934, now seen corresponding path program 1 times [2025-03-16 21:38:39,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:39,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141056712] [2025-03-16 21:38:39,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:39,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:40,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-03-16 21:38:40,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-03-16 21:38:40,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:40,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:40,945 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:40,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:40,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141056712] [2025-03-16 21:38:40,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141056712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:40,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:40,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:40,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392932727] [2025-03-16 21:38:40,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:40,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:40,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:40,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:40,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:40,947 INFO L87 Difference]: Start difference. First operand 1092 states and 1497 transitions. Second operand has 5 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:41,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:41,256 INFO L93 Difference]: Finished difference Result 1801 states and 2483 transitions. [2025-03-16 21:38:41,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:41,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 709 [2025-03-16 21:38:41,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:41,258 INFO L225 Difference]: With dead ends: 1801 [2025-03-16 21:38:41,258 INFO L226 Difference]: Without dead ends: 1092 [2025-03-16 21:38:41,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:41,259 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 1966 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1969 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:41,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1969 Valid, 1847 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-03-16 21:38:41,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1092. [2025-03-16 21:38:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1084 states have (on average 1.3690036900369005) internal successors, (1484), 1084 states have internal predecessors, (1484), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1496 transitions. [2025-03-16 21:38:41,272 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1496 transitions. Word has length 709 [2025-03-16 21:38:41,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:41,272 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1496 transitions. [2025-03-16 21:38:41,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:41,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1496 transitions. [2025-03-16 21:38:41,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-03-16 21:38:41,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:41,275 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:41,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-03-16 21:38:41,276 INFO L396 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:41,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:41,276 INFO L85 PathProgramCache]: Analyzing trace with hash 131581548, now seen corresponding path program 1 times [2025-03-16 21:38:41,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:41,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682604363] [2025-03-16 21:38:41,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:41,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:41,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-16 21:38:41,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-16 21:38:41,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:41,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:42,076 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:42,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:42,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682604363] [2025-03-16 21:38:42,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682604363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:42,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:42,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:42,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578646565] [2025-03-16 21:38:42,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:42,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:42,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:42,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:42,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:42,077 INFO L87 Difference]: Start difference. First operand 1092 states and 1496 transitions. Second operand has 5 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:42,385 INFO L93 Difference]: Finished difference Result 1801 states and 2481 transitions. [2025-03-16 21:38:42,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:42,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 710 [2025-03-16 21:38:42,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:42,386 INFO L225 Difference]: With dead ends: 1801 [2025-03-16 21:38:42,386 INFO L226 Difference]: Without dead ends: 1092 [2025-03-16 21:38:42,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:42,387 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 1068 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:42,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 1853 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:42,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-03-16 21:38:42,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1092. [2025-03-16 21:38:42,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1084 states have (on average 1.368081180811808) internal successors, (1483), 1084 states have internal predecessors, (1483), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1495 transitions. [2025-03-16 21:38:42,400 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1495 transitions. Word has length 710 [2025-03-16 21:38:42,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:42,401 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1495 transitions. [2025-03-16 21:38:42,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1495 transitions. [2025-03-16 21:38:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2025-03-16 21:38:42,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:42,404 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:42,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-03-16 21:38:42,404 INFO L396 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:42,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:42,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1629646275, now seen corresponding path program 1 times [2025-03-16 21:38:42,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:42,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573867498] [2025-03-16 21:38:42,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:42,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:42,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 711 statements into 1 equivalence classes. [2025-03-16 21:38:42,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 711 of 711 statements. [2025-03-16 21:38:42,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:42,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:43,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:43,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573867498] [2025-03-16 21:38:43,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573867498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:43,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:43,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:43,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160321924] [2025-03-16 21:38:43,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:43,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:43,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:43,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:43,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:43,247 INFO L87 Difference]: Start difference. First operand 1092 states and 1495 transitions. Second operand has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:43,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:43,545 INFO L93 Difference]: Finished difference Result 1801 states and 2479 transitions. [2025-03-16 21:38:43,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:43,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 711 [2025-03-16 21:38:43,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:43,547 INFO L225 Difference]: With dead ends: 1801 [2025-03-16 21:38:43,547 INFO L226 Difference]: Without dead ends: 1092 [2025-03-16 21:38:43,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:43,547 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 1934 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1937 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:43,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1937 Valid, 1847 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-03-16 21:38:43,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1092. [2025-03-16 21:38:43,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1084 states have (on average 1.367158671586716) internal successors, (1482), 1084 states have internal predecessors, (1482), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:38:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1494 transitions. [2025-03-16 21:38:43,559 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1494 transitions. Word has length 711 [2025-03-16 21:38:43,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:43,560 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1494 transitions. [2025-03-16 21:38:43,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:38:43,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1494 transitions. [2025-03-16 21:38:43,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2025-03-16 21:38:43,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:43,563 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:38:43,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-03-16 21:38:43,563 INFO L396 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:43,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:43,563 INFO L85 PathProgramCache]: Analyzing trace with hash 137576285, now seen corresponding path program 1 times [2025-03-16 21:38:43,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:43,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921213034] [2025-03-16 21:38:43,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:43,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:43,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 712 statements into 1 equivalence classes. [2025-03-16 21:38:43,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 712 of 712 statements. [2025-03-16 21:38:43,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:43,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:38:44,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:44,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921213034] [2025-03-16 21:38:44,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921213034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:44,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:44,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:38:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610186028] [2025-03-16 21:38:44,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:44,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:44,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:44,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:44,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:44,370 INFO L87 Difference]: Start difference. First operand 1092 states and 1494 transitions. Second operand has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)