./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d64_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d64_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 dcc8d23cd9f485072084eb5fea8ae908ba08518a8b9707f57a9860924bd91f5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 08:31:57,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 08:31:57,149 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 08:31:57,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 08:31:57,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 08:31:57,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 08:31:57,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 08:31:57,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 08:31:57,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 08:31:57,178 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 08:31:57,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 08:31:57,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 08:31:57,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 08:31:57,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 08:31:57,179 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 08:31:57,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 08:31:57,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 08:31:57,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 08:31:57,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 08:31:57,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 08:31:57,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 08:31:57,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 08:31:57,180 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 08:31:57,180 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 08:31:57,180 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 08:31:57,180 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 08:31:57,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 08:31:57,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 08:31:57,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 08:31:57,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:31:57,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 08:31:57,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 08:31:57,181 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 08:31:57,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 08:31:57,182 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 08:31:57,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 08:31:57,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 08:31:57,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 08:31:57,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 08:31:57,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 08:31:57,182 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 -> dcc8d23cd9f485072084eb5fea8ae908ba08518a8b9707f57a9860924bd91f5c [2025-03-08 08:31:57,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 08:31:57,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 08:31:57,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 08:31:57,423 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 08:31:57,423 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 08:31:57,424 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_w8_d64_e0.c [2025-03-08 08:31:58,512 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e05e6900a/eb37a472e0df442c94b45d8175e912b2/FLAGfc1935ba1 [2025-03-08 08:31:58,866 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 08:31:58,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d64_e0.c [2025-03-08 08:31:58,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e05e6900a/eb37a472e0df442c94b45d8175e912b2/FLAGfc1935ba1 [2025-03-08 08:31:59,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e05e6900a/eb37a472e0df442c94b45d8175e912b2 [2025-03-08 08:31:59,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 08:31:59,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 08:31:59,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 08:31:59,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 08:31:59,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 08:31:59,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:31:59" (1/1) ... [2025-03-08 08:31:59,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a4e0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:31:59, skipping insertion in model container [2025-03-08 08:31:59,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:31:59" (1/1) ... [2025-03-08 08:31:59,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 08:31:59,257 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_w8_d64_e0.c[1279,1292] [2025-03-08 08:31:59,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:31:59,519 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 08:31:59,525 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_w8_d64_e0.c[1279,1292] [2025-03-08 08:31:59,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:31:59,705 INFO L204 MainTranslator]: Completed translation [2025-03-08 08:31:59,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:31:59 WrapperNode [2025-03-08 08:31:59,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 08:31:59,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 08:31:59,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 08:31:59,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 08:31:59,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:31:59" (1/1) ... [2025-03-08 08:31:59,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:31:59" (1/1) ... [2025-03-08 08:32:00,194 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 5529 [2025-03-08 08:32:00,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 08:32:00,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 08:32:00,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 08:32:00,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 08:32:00,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:31:59" (1/1) ... [2025-03-08 08:32:00,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:31:59" (1/1) ... [2025-03-08 08:32:00,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:31:59" (1/1) ... [2025-03-08 08:32:00,523 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 08:32:00,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:31:59" (1/1) ... [2025-03-08 08:32:00,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:31:59" (1/1) ... [2025-03-08 08:32:00,644 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:31:59" (1/1) ... [2025-03-08 08:32:00,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:31:59" (1/1) ... [2025-03-08 08:32:00,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:31:59" (1/1) ... [2025-03-08 08:32:00,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:31:59" (1/1) ... [2025-03-08 08:32:00,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 08:32:00,794 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 08:32:00,794 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 08:32:00,794 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 08:32:00,795 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:31:59" (1/1) ... [2025-03-08 08:32:00,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:32:00,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:32:00,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 08:32:00,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 08:32:00,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 08:32:00,835 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 08:32:00,835 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 08:32:00,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 08:32:00,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 08:32:00,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 08:32:01,195 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 08:32:01,196 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 08:32:06,710 INFO L? ?]: Removed 3108 outVars from TransFormulas that were not future-live. [2025-03-08 08:32:06,711 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 08:32:06,878 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 08:32:06,881 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 08:32:06,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:32:06 BoogieIcfgContainer [2025-03-08 08:32:06,882 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 08:32:06,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 08:32:06,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 08:32:06,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 08:32:06,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 08:31:59" (1/3) ... [2025-03-08 08:32:06,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f00b568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:32:06, skipping insertion in model container [2025-03-08 08:32:06,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:31:59" (2/3) ... [2025-03-08 08:32:06,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f00b568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:32:06, skipping insertion in model container [2025-03-08 08:32:06,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:32:06" (3/3) ... [2025-03-08 08:32:06,889 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w8_d64_e0.c [2025-03-08 08:32:06,900 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 08:32:06,902 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.circular_pointer_top_w8_d64_e0.c that has 2 procedures, 1512 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 08:32:06,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 08:32:06,975 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;@556aa847, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 08:32:06,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 08:32:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 1512 states, 1506 states have (on average 1.49800796812749) internal successors, (2256), 1507 states have internal predecessors, (2256), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-08 08:32:07,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:07,005 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:07,006 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:07,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:07,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1180503003, now seen corresponding path program 1 times [2025-03-08 08:32:07,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:07,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344407145] [2025-03-08 08:32:07,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:07,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:07,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-08 08:32:07,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-08 08:32:07,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:07,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 08:32:07,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:07,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344407145] [2025-03-08 08:32:07,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344407145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 08:32:07,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916528167] [2025-03-08 08:32:07,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:07,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:32:07,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:32:07,656 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:32:07,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 08:32:08,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-08 08:32:08,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-08 08:32:08,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:08,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:08,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 2371 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 08:32:08,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:32:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 08:32:08,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 08:32:08,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916528167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:08,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 08:32:08,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 08:32:08,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125691595] [2025-03-08 08:32:08,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:08,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 08:32:08,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:08,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 08:32:08,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 08:32:08,525 INFO L87 Difference]: Start difference. First operand has 1512 states, 1506 states have (on average 1.49800796812749) internal successors, (2256), 1507 states have internal predecessors, (2256), 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 165.5) internal successors, (331), 2 states have internal predecessors, (331), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 08:32:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:08,868 INFO L93 Difference]: Finished difference Result 2727 states and 4085 transitions. [2025-03-08 08:32:08,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 08:32:08,870 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 165.5) internal successors, (331), 2 states have internal predecessors, (331), 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 341 [2025-03-08 08:32:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:08,881 INFO L225 Difference]: With dead ends: 2727 [2025-03-08 08:32:08,881 INFO L226 Difference]: Without dead ends: 1509 [2025-03-08 08:32:08,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 08:32:08,887 INFO L435 NwaCegarLoop]: 1884 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:08,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1884 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:32:08,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2025-03-08 08:32:08,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2025-03-08 08:32:08,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1504 states have (on average 1.4966755319148937) internal successors, (2251), 1504 states have internal predecessors, (2251), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:08,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2257 transitions. [2025-03-08 08:32:08,965 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2257 transitions. Word has length 341 [2025-03-08 08:32:08,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:08,965 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 2257 transitions. [2025-03-08 08:32:08,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 165.5) internal successors, (331), 2 states have internal predecessors, (331), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 08:32:08,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2257 transitions. [2025-03-08 08:32:08,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-08 08:32:08,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:08,974 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:08,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 08:32:09,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 08:32:09,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:09,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:09,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2054262920, now seen corresponding path program 1 times [2025-03-08 08:32:09,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:09,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925080108] [2025-03-08 08:32:09,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:09,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:09,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-08 08:32:09,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-08 08:32:09,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:09,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:10,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:10,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:10,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925080108] [2025-03-08 08:32:10,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925080108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:10,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:10,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:32:10,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721581409] [2025-03-08 08:32:10,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:10,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:32:10,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:10,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:32:10,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:32:10,969 INFO L87 Difference]: Start difference. First operand 1509 states and 2257 transitions. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:11,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:11,594 INFO L93 Difference]: Finished difference Result 1513 states and 2261 transitions. [2025-03-08 08:32:11,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:11,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 1 states have call successors, (3), 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 341 [2025-03-08 08:32:11,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:11,602 INFO L225 Difference]: With dead ends: 1513 [2025-03-08 08:32:11,602 INFO L226 Difference]: Without dead ends: 1511 [2025-03-08 08:32:11,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:32:11,604 INFO L435 NwaCegarLoop]: 1882 mSDtfsCounter, 0 mSDsluCounter, 3759 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5641 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:11,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5641 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:11,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2025-03-08 08:32:11,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1511. [2025-03-08 08:32:11,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1506 states have (on average 1.49601593625498) internal successors, (2253), 1506 states have internal predecessors, (2253), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:11,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2259 transitions. [2025-03-08 08:32:11,634 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2259 transitions. Word has length 341 [2025-03-08 08:32:11,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:11,636 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 2259 transitions. [2025-03-08 08:32:11,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:11,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2259 transitions. [2025-03-08 08:32:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-08 08:32:11,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:11,640 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:11,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 08:32:11,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:11,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:11,641 INFO L85 PathProgramCache]: Analyzing trace with hash 747039563, now seen corresponding path program 1 times [2025-03-08 08:32:11,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:11,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258874410] [2025-03-08 08:32:11,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:11,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:11,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-08 08:32:11,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-08 08:32:11,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:11,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:12,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:12,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258874410] [2025-03-08 08:32:12,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258874410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:12,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:12,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:12,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703960852] [2025-03-08 08:32:12,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:12,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:12,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:12,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:12,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:12,411 INFO L87 Difference]: Start difference. First operand 1511 states and 2259 transitions. Second operand has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:13,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:13,968 INFO L93 Difference]: Finished difference Result 3771 states and 5641 transitions. [2025-03-08 08:32:13,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 08:32:13,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 1 states have call successors, (3), 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 342 [2025-03-08 08:32:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:13,974 INFO L225 Difference]: With dead ends: 3771 [2025-03-08 08:32:13,975 INFO L226 Difference]: Without dead ends: 1511 [2025-03-08 08:32:13,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:32:13,980 INFO L435 NwaCegarLoop]: 1869 mSDtfsCounter, 4786 mSDsluCounter, 3411 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4786 SdHoareTripleChecker+Valid, 5280 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:13,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4786 Valid, 5280 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 08:32:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2025-03-08 08:32:14,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1511. [2025-03-08 08:32:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1506 states have (on average 1.49535192563081) internal successors, (2252), 1506 states have internal predecessors, (2252), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:14,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2258 transitions. [2025-03-08 08:32:14,009 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2258 transitions. Word has length 342 [2025-03-08 08:32:14,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:14,010 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 2258 transitions. [2025-03-08 08:32:14,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:14,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2258 transitions. [2025-03-08 08:32:14,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-08 08:32:14,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:14,014 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:14,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 08:32:14,014 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:14,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:14,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1246298674, now seen corresponding path program 1 times [2025-03-08 08:32:14,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:14,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652427039] [2025-03-08 08:32:14,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:14,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:14,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-08 08:32:14,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-08 08:32:14,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:14,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:14,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:14,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652427039] [2025-03-08 08:32:14,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652427039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:14,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:14,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:32:14,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806202679] [2025-03-08 08:32:14,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:14,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:32:14,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:14,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:32:14,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:32:14,693 INFO L87 Difference]: Start difference. First operand 1511 states and 2258 transitions. Second operand has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:15,256 INFO L93 Difference]: Finished difference Result 2730 states and 4079 transitions. [2025-03-08 08:32:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:15,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 1 states have call successors, (3), 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 343 [2025-03-08 08:32:15,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:15,262 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:15,262 INFO L226 Difference]: Without dead ends: 1513 [2025-03-08 08:32:15,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:32:15,264 INFO L435 NwaCegarLoop]: 1881 mSDtfsCounter, 0 mSDsluCounter, 3754 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5635 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:15,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5635 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:32:15,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-03-08 08:32:15,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-03-08 08:32:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4946949602122015) internal successors, (2254), 1508 states have internal predecessors, (2254), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2260 transitions. [2025-03-08 08:32:15,291 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2260 transitions. Word has length 343 [2025-03-08 08:32:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:15,292 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2260 transitions. [2025-03-08 08:32:15,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2260 transitions. [2025-03-08 08:32:15,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-08 08:32:15,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:15,296 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:15,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 08:32:15,296 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:15,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:15,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1950957488, now seen corresponding path program 1 times [2025-03-08 08:32:15,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:15,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303770958] [2025-03-08 08:32:15,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:15,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:15,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-08 08:32:15,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-08 08:32:15,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:15,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:16,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:16,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303770958] [2025-03-08 08:32:16,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303770958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:16,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:16,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:32:16,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627854035] [2025-03-08 08:32:16,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:16,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:32:16,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:16,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:32:16,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:32:16,218 INFO L87 Difference]: Start difference. First operand 1513 states and 2260 transitions. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:16,787 INFO L93 Difference]: Finished difference Result 2731 states and 4079 transitions. [2025-03-08 08:32:16,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:16,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 1 states have call successors, (3), 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 344 [2025-03-08 08:32:16,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:16,793 INFO L225 Difference]: With dead ends: 2731 [2025-03-08 08:32:16,793 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:16,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:16,796 INFO L435 NwaCegarLoop]: 1865 mSDtfsCounter, 2051 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2051 SdHoareTripleChecker+Valid, 3732 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:16,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2051 Valid, 3732 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:32:16,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:16,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.493696084936961) internal successors, (2251), 1507 states have internal predecessors, (2251), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2257 transitions. [2025-03-08 08:32:16,825 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2257 transitions. Word has length 344 [2025-03-08 08:32:16,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:16,826 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2257 transitions. [2025-03-08 08:32:16,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:16,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2257 transitions. [2025-03-08 08:32:16,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-08 08:32:16,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:16,830 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:16,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 08:32:16,830 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:16,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:16,831 INFO L85 PathProgramCache]: Analyzing trace with hash 145347561, now seen corresponding path program 1 times [2025-03-08 08:32:16,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:16,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278841015] [2025-03-08 08:32:16,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:16,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:16,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-08 08:32:17,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-08 08:32:17,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:17,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:17,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:17,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278841015] [2025-03-08 08:32:17,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278841015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:17,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:17,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:17,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668206549] [2025-03-08 08:32:17,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:17,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:17,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:17,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:17,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:17,380 INFO L87 Difference]: Start difference. First operand 1512 states and 2257 transitions. Second operand has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:18,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:18,029 INFO L93 Difference]: Finished difference Result 2732 states and 4076 transitions. [2025-03-08 08:32:18,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:32:18,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 1 states have call successors, (3), 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 345 [2025-03-08 08:32:18,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:18,035 INFO L225 Difference]: With dead ends: 2732 [2025-03-08 08:32:18,035 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:18,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:32:18,039 INFO L435 NwaCegarLoop]: 1875 mSDtfsCounter, 2055 mSDsluCounter, 3744 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2055 SdHoareTripleChecker+Valid, 5619 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:18,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2055 Valid, 5619 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:18,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:18,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:18,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4930325149303252) internal successors, (2250), 1507 states have internal predecessors, (2250), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2256 transitions. [2025-03-08 08:32:18,064 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2256 transitions. Word has length 345 [2025-03-08 08:32:18,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:18,064 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2256 transitions. [2025-03-08 08:32:18,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:18,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2256 transitions. [2025-03-08 08:32:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-08 08:32:18,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:18,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:18,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 08:32:18,067 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:18,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:18,067 INFO L85 PathProgramCache]: Analyzing trace with hash 687873035, now seen corresponding path program 1 times [2025-03-08 08:32:18,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:18,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553621120] [2025-03-08 08:32:18,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:18,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:18,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-08 08:32:18,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-08 08:32:18,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:18,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:19,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:19,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553621120] [2025-03-08 08:32:19,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553621120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:19,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:19,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:32:19,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621599552] [2025-03-08 08:32:19,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:19,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:32:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:19,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:32:19,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:32:19,103 INFO L87 Difference]: Start difference. First operand 1512 states and 2256 transitions. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:19,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:19,966 INFO L93 Difference]: Finished difference Result 2730 states and 4072 transitions. [2025-03-08 08:32:19,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:19,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 1 states have call successors, (3), 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 346 [2025-03-08 08:32:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:19,970 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:19,970 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:19,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:19,972 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 1930 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:19,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1930 Valid, 3246 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 08:32:19,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:19,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:19,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4923689449236894) internal successors, (2249), 1507 states have internal predecessors, (2249), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2255 transitions. [2025-03-08 08:32:19,996 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2255 transitions. Word has length 346 [2025-03-08 08:32:19,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:19,996 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2255 transitions. [2025-03-08 08:32:19,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2255 transitions. [2025-03-08 08:32:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-08 08:32:19,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:19,998 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:19,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 08:32:19,998 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:19,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:19,999 INFO L85 PathProgramCache]: Analyzing trace with hash -93851097, now seen corresponding path program 1 times [2025-03-08 08:32:19,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:19,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256062410] [2025-03-08 08:32:19,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:19,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:20,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-08 08:32:20,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-08 08:32:20,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:20,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:20,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:20,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:20,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256062410] [2025-03-08 08:32:20,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256062410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:20,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:20,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:20,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479593923] [2025-03-08 08:32:20,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:20,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:20,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:20,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:20,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:20,495 INFO L87 Difference]: Start difference. First operand 1512 states and 2255 transitions. Second operand has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:21,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:21,239 INFO L93 Difference]: Finished difference Result 2790 states and 4159 transitions. [2025-03-08 08:32:21,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:32:21,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 1 states have call successors, (3), 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 347 [2025-03-08 08:32:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:21,246 INFO L225 Difference]: With dead ends: 2790 [2025-03-08 08:32:21,247 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:21,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:32:21,248 INFO L435 NwaCegarLoop]: 1844 mSDtfsCounter, 2049 mSDsluCounter, 3470 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2049 SdHoareTripleChecker+Valid, 5314 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:21,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2049 Valid, 5314 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 08:32:21,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:21,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4917053749170537) internal successors, (2248), 1507 states have internal predecessors, (2248), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2254 transitions. [2025-03-08 08:32:21,271 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2254 transitions. Word has length 347 [2025-03-08 08:32:21,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:21,271 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2254 transitions. [2025-03-08 08:32:21,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:21,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2254 transitions. [2025-03-08 08:32:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-08 08:32:21,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:21,274 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:21,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 08:32:21,274 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:21,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:21,275 INFO L85 PathProgramCache]: Analyzing trace with hash -915692619, now seen corresponding path program 1 times [2025-03-08 08:32:21,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:21,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571667155] [2025-03-08 08:32:21,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:21,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:21,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-08 08:32:21,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-08 08:32:21,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:21,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:21,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:21,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571667155] [2025-03-08 08:32:21,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571667155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:21,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:21,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:21,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474069920] [2025-03-08 08:32:21,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:21,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:21,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:21,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:21,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:21,964 INFO L87 Difference]: Start difference. First operand 1512 states and 2254 transitions. Second operand has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:22,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:22,628 INFO L93 Difference]: Finished difference Result 2730 states and 4068 transitions. [2025-03-08 08:32:22,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:22,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 1 states have call successors, (3), 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 348 [2025-03-08 08:32:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:22,635 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:22,635 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:22,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:22,639 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 4221 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4224 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:22,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4224 Valid, 3246 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:22,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:22,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4910418049104182) internal successors, (2247), 1507 states have internal predecessors, (2247), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2253 transitions. [2025-03-08 08:32:22,660 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2253 transitions. Word has length 348 [2025-03-08 08:32:22,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:22,661 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2253 transitions. [2025-03-08 08:32:22,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:22,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2253 transitions. [2025-03-08 08:32:22,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-08 08:32:22,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:22,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:22,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 08:32:22,664 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:22,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:22,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1305578540, now seen corresponding path program 1 times [2025-03-08 08:32:22,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:22,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120923831] [2025-03-08 08:32:22,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:22,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:22,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-08 08:32:22,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-08 08:32:22,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:22,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:23,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:23,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120923831] [2025-03-08 08:32:23,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120923831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:23,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:23,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:23,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333802302] [2025-03-08 08:32:23,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:23,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:23,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:23,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:23,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:23,150 INFO L87 Difference]: Start difference. First operand 1512 states and 2253 transitions. Second operand has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:23,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:23,876 INFO L93 Difference]: Finished difference Result 2730 states and 4066 transitions. [2025-03-08 08:32:23,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:23,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 1 states have call successors, (3), 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 349 [2025-03-08 08:32:23,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:23,880 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:23,880 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:23,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:23,881 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 2234 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2237 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:23,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2237 Valid, 3253 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 08:32:23,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:23,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:23,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4903782349037824) internal successors, (2246), 1507 states have internal predecessors, (2246), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:23,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2252 transitions. [2025-03-08 08:32:23,898 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2252 transitions. Word has length 349 [2025-03-08 08:32:23,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:23,898 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2252 transitions. [2025-03-08 08:32:23,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2252 transitions. [2025-03-08 08:32:23,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-08 08:32:23,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:23,900 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:23,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 08:32:23,901 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:23,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:23,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1358129178, now seen corresponding path program 1 times [2025-03-08 08:32:23,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:23,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895988993] [2025-03-08 08:32:23,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:23,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:23,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-08 08:32:24,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-08 08:32:24,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:24,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:24,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:24,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895988993] [2025-03-08 08:32:24,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895988993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:24,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:24,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:24,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946926486] [2025-03-08 08:32:24,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:24,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:24,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:24,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:24,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:24,493 INFO L87 Difference]: Start difference. First operand 1512 states and 2252 transitions. Second operand has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:25,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:25,212 INFO L93 Difference]: Finished difference Result 2730 states and 4064 transitions. [2025-03-08 08:32:25,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:25,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 1 states have call successors, (3), 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 350 [2025-03-08 08:32:25,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:25,216 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:25,216 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:25,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:25,218 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 2230 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2233 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:25,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2233 Valid, 3253 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 08:32:25,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:25,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:25,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4897146648971467) internal successors, (2245), 1507 states have internal predecessors, (2245), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:25,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2251 transitions. [2025-03-08 08:32:25,242 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2251 transitions. Word has length 350 [2025-03-08 08:32:25,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:25,242 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2251 transitions. [2025-03-08 08:32:25,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:25,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2251 transitions. [2025-03-08 08:32:25,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-08 08:32:25,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:25,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:25,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 08:32:25,244 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:25,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:25,253 INFO L85 PathProgramCache]: Analyzing trace with hash 10575025, now seen corresponding path program 1 times [2025-03-08 08:32:25,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:25,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430589240] [2025-03-08 08:32:25,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:25,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:25,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-08 08:32:25,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-08 08:32:25,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:25,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:25,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-08 08:32:25,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:25,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430589240] [2025-03-08 08:32:25,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430589240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:25,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:25,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:25,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568883143] [2025-03-08 08:32:25,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:25,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:25,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:25,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:25,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:25,791 INFO L87 Difference]: Start difference. First operand 1512 states and 2251 transitions. Second operand has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:26,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:26,426 INFO L93 Difference]: Finished difference Result 2730 states and 4062 transitions. [2025-03-08 08:32:26,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:26,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 1 states have call successors, (3), 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 351 [2025-03-08 08:32:26,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:26,430 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:26,431 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:26,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:26,433 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 2226 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2229 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:26,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2229 Valid, 3253 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:26,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:26,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:26,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.489051094890511) internal successors, (2244), 1507 states have internal predecessors, (2244), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:26,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2250 transitions. [2025-03-08 08:32:26,479 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2250 transitions. Word has length 351 [2025-03-08 08:32:26,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:26,479 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2250 transitions. [2025-03-08 08:32:26,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:26,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2250 transitions. [2025-03-08 08:32:26,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-03-08 08:32:26,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:26,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:26,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 08:32:26,482 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:26,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:26,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1386857729, now seen corresponding path program 1 times [2025-03-08 08:32:26,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:26,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421735399] [2025-03-08 08:32:26,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:26,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:26,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-08 08:32:26,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-08 08:32:26,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:26,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:27,005 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:27,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:27,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421735399] [2025-03-08 08:32:27,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421735399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:27,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:27,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:27,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21170830] [2025-03-08 08:32:27,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:27,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:27,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:27,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:27,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:27,007 INFO L87 Difference]: Start difference. First operand 1512 states and 2250 transitions. Second operand has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:27,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:27,709 INFO L93 Difference]: Finished difference Result 2730 states and 4060 transitions. [2025-03-08 08:32:27,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:27,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 1 states have call successors, (3), 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 352 [2025-03-08 08:32:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:27,715 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:27,715 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:27,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:27,718 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 4189 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4192 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:27,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4192 Valid, 3246 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 08:32:27,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:27,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4883875248838752) internal successors, (2243), 1507 states have internal predecessors, (2243), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2249 transitions. [2025-03-08 08:32:27,736 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2249 transitions. Word has length 352 [2025-03-08 08:32:27,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:27,736 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2249 transitions. [2025-03-08 08:32:27,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:27,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2249 transitions. [2025-03-08 08:32:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-08 08:32:27,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:27,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:27,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 08:32:27,739 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:27,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:27,739 INFO L85 PathProgramCache]: Analyzing trace with hash -678714442, now seen corresponding path program 1 times [2025-03-08 08:32:27,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:27,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208673758] [2025-03-08 08:32:27,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:27,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:27,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-08 08:32:27,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-08 08:32:27,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:27,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:28,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:28,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:28,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208673758] [2025-03-08 08:32:28,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208673758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:28,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:28,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:28,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601098499] [2025-03-08 08:32:28,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:28,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:28,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:28,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:28,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:28,239 INFO L87 Difference]: Start difference. First operand 1512 states and 2249 transitions. Second operand has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:28,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:28,940 INFO L93 Difference]: Finished difference Result 2730 states and 4058 transitions. [2025-03-08 08:32:28,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:28,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 1 states have call successors, (3), 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 353 [2025-03-08 08:32:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:28,944 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:28,944 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:28,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:28,945 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 4181 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4184 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:28,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4184 Valid, 3246 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 08:32:28,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:28,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4877239548772396) internal successors, (2242), 1507 states have internal predecessors, (2242), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2248 transitions. [2025-03-08 08:32:28,961 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2248 transitions. Word has length 353 [2025-03-08 08:32:28,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:28,962 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2248 transitions. [2025-03-08 08:32:28,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2248 transitions. [2025-03-08 08:32:28,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-08 08:32:28,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:28,965 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:28,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 08:32:28,965 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:28,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:28,966 INFO L85 PathProgramCache]: Analyzing trace with hash 300571748, now seen corresponding path program 1 times [2025-03-08 08:32:28,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:28,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144147529] [2025-03-08 08:32:28,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:28,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:29,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-08 08:32:29,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-08 08:32:29,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:29,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:29,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:29,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:29,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144147529] [2025-03-08 08:32:29,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144147529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:29,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:29,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:29,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650639679] [2025-03-08 08:32:29,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:29,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:29,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:29,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:29,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:29,437 INFO L87 Difference]: Start difference. First operand 1512 states and 2248 transitions. Second operand has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:30,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:30,176 INFO L93 Difference]: Finished difference Result 2730 states and 4056 transitions. [2025-03-08 08:32:30,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:30,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 1 states have call successors, (3), 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 354 [2025-03-08 08:32:30,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:30,179 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:30,180 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:30,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:30,181 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 4173 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4176 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:30,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4176 Valid, 3246 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 08:32:30,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:30,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:30,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4870603848706039) internal successors, (2241), 1507 states have internal predecessors, (2241), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:30,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2247 transitions. [2025-03-08 08:32:30,199 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2247 transitions. Word has length 354 [2025-03-08 08:32:30,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:30,200 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2247 transitions. [2025-03-08 08:32:30,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:30,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2247 transitions. [2025-03-08 08:32:30,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-08 08:32:30,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:30,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 08:32:30,203 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:30,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:30,204 INFO L85 PathProgramCache]: Analyzing trace with hash -366698181, now seen corresponding path program 1 times [2025-03-08 08:32:30,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:30,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651964131] [2025-03-08 08:32:30,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:30,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:30,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-08 08:32:30,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-08 08:32:30,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:30,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:30,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-08 08:32:30,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:30,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651964131] [2025-03-08 08:32:30,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651964131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:30,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:30,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:30,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942169508] [2025-03-08 08:32:30,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:30,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:30,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:30,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:30,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:30,665 INFO L87 Difference]: Start difference. First operand 1512 states and 2247 transitions. Second operand has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:31,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:31,279 INFO L93 Difference]: Finished difference Result 2730 states and 4054 transitions. [2025-03-08 08:32:31,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:31,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 1 states have call successors, (3), 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 355 [2025-03-08 08:32:31,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:31,284 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:31,284 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:31,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:31,285 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 2210 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2213 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:31,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2213 Valid, 3253 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:31,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:31,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4863968148639681) internal successors, (2240), 1507 states have internal predecessors, (2240), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:31,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2246 transitions. [2025-03-08 08:32:31,298 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2246 transitions. Word has length 355 [2025-03-08 08:32:31,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:31,298 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2246 transitions. [2025-03-08 08:32:31,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:31,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2246 transitions. [2025-03-08 08:32:31,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-08 08:32:31,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:31,300 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:31,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 08:32:31,301 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:31,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:31,301 INFO L85 PathProgramCache]: Analyzing trace with hash -530183095, now seen corresponding path program 1 times [2025-03-08 08:32:31,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:31,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652521938] [2025-03-08 08:32:31,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:31,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:31,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-08 08:32:31,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-08 08:32:31,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:31,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:31,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:31,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:31,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652521938] [2025-03-08 08:32:31,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652521938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:31,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:31,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:31,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824581302] [2025-03-08 08:32:31,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:31,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:31,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:31,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:31,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:31,760 INFO L87 Difference]: Start difference. First operand 1512 states and 2246 transitions. Second operand has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:32,473 INFO L93 Difference]: Finished difference Result 2730 states and 4052 transitions. [2025-03-08 08:32:32,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:32,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 1 states have call successors, (3), 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 356 [2025-03-08 08:32:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:32,476 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:32,477 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:32,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:32,478 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 2206 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2209 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:32,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2209 Valid, 3253 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 08:32:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:32,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:32,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4857332448573324) internal successors, (2239), 1507 states have internal predecessors, (2239), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2245 transitions. [2025-03-08 08:32:32,492 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2245 transitions. Word has length 356 [2025-03-08 08:32:32,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:32,492 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2245 transitions. [2025-03-08 08:32:32,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2245 transitions. [2025-03-08 08:32:32,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-08 08:32:32,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:32,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:32,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 08:32:32,494 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:32,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:32,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1658885440, now seen corresponding path program 1 times [2025-03-08 08:32:32,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:32,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19529460] [2025-03-08 08:32:32,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:32,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:32,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-08 08:32:32,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-08 08:32:32,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:32,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:32,960 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:32,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:32,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19529460] [2025-03-08 08:32:32,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19529460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:32,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:32,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:32,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589960308] [2025-03-08 08:32:32,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:32,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:32,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:32,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:32,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:32,962 INFO L87 Difference]: Start difference. First operand 1512 states and 2245 transitions. Second operand has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:33,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:33,581 INFO L93 Difference]: Finished difference Result 2730 states and 4050 transitions. [2025-03-08 08:32:33,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:33,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 1 states have call successors, (3), 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 357 [2025-03-08 08:32:33,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:33,585 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:33,586 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:33,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:33,589 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 2202 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2205 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:33,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2205 Valid, 3253 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:33,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:33,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:33,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4850696748506969) internal successors, (2238), 1507 states have internal predecessors, (2238), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2244 transitions. [2025-03-08 08:32:33,603 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2244 transitions. Word has length 357 [2025-03-08 08:32:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:33,603 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2244 transitions. [2025-03-08 08:32:33,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2244 transitions. [2025-03-08 08:32:33,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-03-08 08:32:33,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:33,605 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:33,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 08:32:33,605 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:33,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:33,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1998615890, now seen corresponding path program 1 times [2025-03-08 08:32:33,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:33,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537976917] [2025-03-08 08:32:33,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:33,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:33,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-08 08:32:33,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-08 08:32:33,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:33,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:34,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:34,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537976917] [2025-03-08 08:32:34,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537976917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:34,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:34,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:34,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624423686] [2025-03-08 08:32:34,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:34,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:34,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:34,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:34,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:34,059 INFO L87 Difference]: Start difference. First operand 1512 states and 2244 transitions. Second operand has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:34,776 INFO L93 Difference]: Finished difference Result 2730 states and 4048 transitions. [2025-03-08 08:32:34,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:34,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 1 states have call successors, (3), 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 358 [2025-03-08 08:32:34,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:34,782 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:34,783 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:34,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-08 08:32:34,784 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 4141 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4144 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:34,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4144 Valid, 3246 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 08:32:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:34,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.484406104844061) internal successors, (2237), 1507 states have internal predecessors, (2237), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2243 transitions. [2025-03-08 08:32:34,796 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2243 transitions. Word has length 358 [2025-03-08 08:32:34,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:34,797 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2243 transitions. [2025-03-08 08:32:34,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:34,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2243 transitions. [2025-03-08 08:32:34,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-03-08 08:32:34,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:34,798 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:34,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 08:32:34,798 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:34,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:34,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1058258885, now seen corresponding path program 1 times [2025-03-08 08:32:34,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:34,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375404083] [2025-03-08 08:32:34,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:34,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:34,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-03-08 08:32:34,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-03-08 08:32:34,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:34,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:35,271 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:35,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:35,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375404083] [2025-03-08 08:32:35,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375404083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:35,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:35,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:35,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697024539] [2025-03-08 08:32:35,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:35,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:35,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:35,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:35,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:35,273 INFO L87 Difference]: Start difference. First operand 1512 states and 2243 transitions. Second operand has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:35,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:35,884 INFO L93 Difference]: Finished difference Result 2730 states and 4046 transitions. [2025-03-08 08:32:35,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:35,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 1 states have call successors, (3), 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 359 [2025-03-08 08:32:35,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:35,887 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:35,887 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:35,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:35,889 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 2194 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2197 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:35,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2197 Valid, 3253 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4837425348374254) internal successors, (2236), 1507 states have internal predecessors, (2236), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2242 transitions. [2025-03-08 08:32:35,901 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2242 transitions. Word has length 359 [2025-03-08 08:32:35,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:35,901 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2242 transitions. [2025-03-08 08:32:35,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2242 transitions. [2025-03-08 08:32:35,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-08 08:32:35,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:35,903 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:35,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 08:32:35,903 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:35,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:35,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1775048595, now seen corresponding path program 1 times [2025-03-08 08:32:35,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:35,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685975542] [2025-03-08 08:32:35,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:35,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:35,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-08 08:32:36,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-08 08:32:36,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:36,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:36,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:36,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685975542] [2025-03-08 08:32:36,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685975542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:36,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:36,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:36,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275639046] [2025-03-08 08:32:36,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:36,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:36,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:36,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:36,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:36,369 INFO L87 Difference]: Start difference. First operand 1512 states and 2242 transitions. Second operand has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:37,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:37,112 INFO L93 Difference]: Finished difference Result 2730 states and 4044 transitions. [2025-03-08 08:32:37,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:37,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 1 states have call successors, (3), 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 360 [2025-03-08 08:32:37,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:37,114 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:37,115 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:37,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:37,117 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 4125 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4128 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:37,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4128 Valid, 3246 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 08:32:37,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:37,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:37,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4830789648307896) internal successors, (2235), 1507 states have internal predecessors, (2235), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2241 transitions. [2025-03-08 08:32:37,144 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2241 transitions. Word has length 360 [2025-03-08 08:32:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:37,144 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2241 transitions. [2025-03-08 08:32:37,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:37,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2241 transitions. [2025-03-08 08:32:37,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-08 08:32:37,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:37,147 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:37,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 08:32:37,148 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:37,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:37,149 INFO L85 PathProgramCache]: Analyzing trace with hash 250765514, now seen corresponding path program 1 times [2025-03-08 08:32:37,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:37,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783145439] [2025-03-08 08:32:37,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:37,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:37,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-08 08:32:37,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-08 08:32:37,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:37,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:37,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:37,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783145439] [2025-03-08 08:32:37,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783145439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:37,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:37,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:37,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956580958] [2025-03-08 08:32:37,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:37,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:37,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:37,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:37,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:37,605 INFO L87 Difference]: Start difference. First operand 1512 states and 2241 transitions. Second operand has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:38,337 INFO L93 Difference]: Finished difference Result 2730 states and 4042 transitions. [2025-03-08 08:32:38,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:38,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 1 states have call successors, (3), 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 361 [2025-03-08 08:32:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:38,341 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:38,341 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:38,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:38,344 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 2186 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2189 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:38,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2189 Valid, 3253 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 08:32:38,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:38,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4824153948241539) internal successors, (2234), 1507 states have internal predecessors, (2234), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:38,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2240 transitions. [2025-03-08 08:32:38,360 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2240 transitions. Word has length 361 [2025-03-08 08:32:38,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:38,360 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2240 transitions. [2025-03-08 08:32:38,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2240 transitions. [2025-03-08 08:32:38,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-08 08:32:38,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:38,362 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:38,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 08:32:38,362 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:38,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:38,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1341852936, now seen corresponding path program 1 times [2025-03-08 08:32:38,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:38,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321661640] [2025-03-08 08:32:38,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:38,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:38,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-08 08:32:38,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-08 08:32:38,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:38,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:38,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:38,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:38,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321661640] [2025-03-08 08:32:38,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321661640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:38,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:38,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:38,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516161039] [2025-03-08 08:32:38,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:38,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:38,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:38,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:38,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:38,809 INFO L87 Difference]: Start difference. First operand 1512 states and 2240 transitions. Second operand has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:39,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:39,516 INFO L93 Difference]: Finished difference Result 2730 states and 4040 transitions. [2025-03-08 08:32:39,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:39,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 1 states have call successors, (3), 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 362 [2025-03-08 08:32:39,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:39,519 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:39,519 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:39,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:39,520 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 2182 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2185 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:39,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2185 Valid, 3253 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 08:32:39,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:39,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4817518248175183) internal successors, (2233), 1507 states have internal predecessors, (2233), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:39,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2239 transitions. [2025-03-08 08:32:39,532 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2239 transitions. Word has length 362 [2025-03-08 08:32:39,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:39,532 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2239 transitions. [2025-03-08 08:32:39,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2239 transitions. [2025-03-08 08:32:39,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-08 08:32:39,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:39,534 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:39,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 08:32:39,534 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:39,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:39,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1248806833, now seen corresponding path program 1 times [2025-03-08 08:32:39,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:39,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655641644] [2025-03-08 08:32:39,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:39,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:39,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-08 08:32:39,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-08 08:32:39,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:39,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:39,994 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:39,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:39,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655641644] [2025-03-08 08:32:39,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655641644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:39,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:39,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:39,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128044077] [2025-03-08 08:32:39,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:39,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:39,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:39,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:39,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:39,995 INFO L87 Difference]: Start difference. First operand 1512 states and 2239 transitions. Second operand has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:40,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:40,571 INFO L93 Difference]: Finished difference Result 2730 states and 4038 transitions. [2025-03-08 08:32:40,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:40,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 1 states have call successors, (3), 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 363 [2025-03-08 08:32:40,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:40,574 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:40,574 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:40,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:40,575 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 2178 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2181 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:40,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2181 Valid, 3253 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:32:40,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:40,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4810882548108826) internal successors, (2232), 1507 states have internal predecessors, (2232), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2238 transitions. [2025-03-08 08:32:40,585 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2238 transitions. Word has length 363 [2025-03-08 08:32:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:40,585 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2238 transitions. [2025-03-08 08:32:40,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2238 transitions. [2025-03-08 08:32:40,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-08 08:32:40,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:40,587 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:40,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 08:32:40,587 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:40,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:40,587 INFO L85 PathProgramCache]: Analyzing trace with hash 918379741, now seen corresponding path program 1 times [2025-03-08 08:32:40,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:40,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189967125] [2025-03-08 08:32:40,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:40,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:40,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-08 08:32:40,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-08 08:32:40,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:40,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:41,084 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:41,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:41,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189967125] [2025-03-08 08:32:41,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189967125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:41,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:41,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:41,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604895886] [2025-03-08 08:32:41,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:41,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:41,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:41,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:41,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:41,087 INFO L87 Difference]: Start difference. First operand 1512 states and 2238 transitions. Second operand has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:41,840 INFO L93 Difference]: Finished difference Result 2730 states and 4036 transitions. [2025-03-08 08:32:41,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:41,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 1 states have call successors, (3), 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 364 [2025-03-08 08:32:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:41,843 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:41,843 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:41,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:41,845 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 4093 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4096 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:41,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4096 Valid, 3246 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 08:32:41,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:41,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:41,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4804246848042468) internal successors, (2231), 1507 states have internal predecessors, (2231), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2237 transitions. [2025-03-08 08:32:41,856 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2237 transitions. Word has length 364 [2025-03-08 08:32:41,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:41,856 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2237 transitions. [2025-03-08 08:32:41,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:41,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2237 transitions. [2025-03-08 08:32:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-08 08:32:41,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:41,858 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:41,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 08:32:41,858 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:41,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:41,858 INFO L85 PathProgramCache]: Analyzing trace with hash 685966932, now seen corresponding path program 1 times [2025-03-08 08:32:41,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:41,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410121194] [2025-03-08 08:32:41,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:41,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:41,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-08 08:32:41,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-08 08:32:41,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:41,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:42,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:42,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410121194] [2025-03-08 08:32:42,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410121194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:42,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:42,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:42,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443166108] [2025-03-08 08:32:42,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:42,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:42,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:42,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:42,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:42,285 INFO L87 Difference]: Start difference. First operand 1512 states and 2237 transitions. Second operand has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:42,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:42,888 INFO L93 Difference]: Finished difference Result 2730 states and 4034 transitions. [2025-03-08 08:32:42,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:42,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 1 states have call successors, (3), 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 365 [2025-03-08 08:32:42,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:42,890 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:42,891 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:42,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:42,892 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 2170 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2173 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:42,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2173 Valid, 3253 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:42,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:42,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.479761114797611) internal successors, (2230), 1507 states have internal predecessors, (2230), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:42,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2236 transitions. [2025-03-08 08:32:42,903 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2236 transitions. Word has length 365 [2025-03-08 08:32:42,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:42,903 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2236 transitions. [2025-03-08 08:32:42,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2236 transitions. [2025-03-08 08:32:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-08 08:32:42,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:42,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:42,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 08:32:42,905 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:42,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:42,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1737266498, now seen corresponding path program 1 times [2025-03-08 08:32:42,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:42,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762135139] [2025-03-08 08:32:42,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:42,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:42,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-08 08:32:43,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-08 08:32:43,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:43,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:43,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:43,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762135139] [2025-03-08 08:32:43,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762135139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:43,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:43,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:43,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378062325] [2025-03-08 08:32:43,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:43,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:43,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:43,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:43,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:43,419 INFO L87 Difference]: Start difference. First operand 1512 states and 2236 transitions. Second operand has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:44,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:44,117 INFO L93 Difference]: Finished difference Result 2730 states and 4032 transitions. [2025-03-08 08:32:44,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:44,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 1 states have call successors, (3), 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 366 [2025-03-08 08:32:44,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:44,120 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:44,120 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:44,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:44,121 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 2166 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2169 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:44,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2169 Valid, 3253 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 08:32:44,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:44,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:44,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4790975447909755) internal successors, (2229), 1507 states have internal predecessors, (2229), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2235 transitions. [2025-03-08 08:32:44,135 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2235 transitions. Word has length 366 [2025-03-08 08:32:44,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:44,135 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2235 transitions. [2025-03-08 08:32:44,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:44,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2235 transitions. [2025-03-08 08:32:44,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-03-08 08:32:44,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:44,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 08:32:44,137 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:44,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:44,137 INFO L85 PathProgramCache]: Analyzing trace with hash 834505433, now seen corresponding path program 1 times [2025-03-08 08:32:44,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:44,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161370947] [2025-03-08 08:32:44,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:44,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:44,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-08 08:32:44,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-08 08:32:44,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:44,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:44,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:44,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161370947] [2025-03-08 08:32:44,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161370947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:44,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:44,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:44,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600249316] [2025-03-08 08:32:44,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:44,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:44,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:44,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:44,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:44,596 INFO L87 Difference]: Start difference. First operand 1512 states and 2235 transitions. Second operand has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:45,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:45,215 INFO L93 Difference]: Finished difference Result 2730 states and 4030 transitions. [2025-03-08 08:32:45,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:45,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 1 states have call successors, (3), 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 367 [2025-03-08 08:32:45,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:45,218 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:45,218 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:45,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:45,220 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 4069 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4072 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:45,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4072 Valid, 3246 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:45,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4784339747843398) internal successors, (2228), 1507 states have internal predecessors, (2228), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:45,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2234 transitions. [2025-03-08 08:32:45,232 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2234 transitions. Word has length 367 [2025-03-08 08:32:45,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:45,232 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2234 transitions. [2025-03-08 08:32:45,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:45,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2234 transitions. [2025-03-08 08:32:45,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-03-08 08:32:45,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:45,234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:45,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 08:32:45,234 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:45,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:45,235 INFO L85 PathProgramCache]: Analyzing trace with hash 443079719, now seen corresponding path program 1 times [2025-03-08 08:32:45,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:45,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432329279] [2025-03-08 08:32:45,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:45,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:45,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-08 08:32:45,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-08 08:32:45,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:45,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:45,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:45,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432329279] [2025-03-08 08:32:45,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432329279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:45,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:45,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:45,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668079328] [2025-03-08 08:32:45,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:45,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:45,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:45,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:45,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:45,718 INFO L87 Difference]: Start difference. First operand 1512 states and 2234 transitions. Second operand has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:46,389 INFO L93 Difference]: Finished difference Result 2730 states and 4028 transitions. [2025-03-08 08:32:46,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:46,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 1 states have call successors, (3), 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 368 [2025-03-08 08:32:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:46,392 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:46,392 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:46,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:46,394 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 2158 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:46,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2161 Valid, 3253 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:46,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:46,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.477770404777704) internal successors, (2227), 1507 states have internal predecessors, (2227), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2233 transitions. [2025-03-08 08:32:46,404 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2233 transitions. Word has length 368 [2025-03-08 08:32:46,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:46,404 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2233 transitions. [2025-03-08 08:32:46,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2233 transitions. [2025-03-08 08:32:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-08 08:32:46,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:46,406 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:46,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 08:32:46,406 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:46,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:46,406 INFO L85 PathProgramCache]: Analyzing trace with hash 735348190, now seen corresponding path program 1 times [2025-03-08 08:32:46,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:46,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832216071] [2025-03-08 08:32:46,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:46,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:46,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-08 08:32:46,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-08 08:32:46,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:46,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:46,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:46,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832216071] [2025-03-08 08:32:46,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832216071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:46,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:46,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:46,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847987696] [2025-03-08 08:32:46,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:46,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:46,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:46,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:46,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:46,839 INFO L87 Difference]: Start difference. First operand 1512 states and 2233 transitions. Second operand has 5 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:47,448 INFO L93 Difference]: Finished difference Result 2730 states and 4026 transitions. [2025-03-08 08:32:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:47,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 1 states have call successors, (3), 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 369 [2025-03-08 08:32:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:47,451 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:47,451 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:47,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:47,453 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 2154 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2157 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:47,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2157 Valid, 3253 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:47,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:47,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:47,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4771068347710683) internal successors, (2226), 1507 states have internal predecessors, (2226), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2232 transitions. [2025-03-08 08:32:47,466 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2232 transitions. Word has length 369 [2025-03-08 08:32:47,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:47,466 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2232 transitions. [2025-03-08 08:32:47,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:47,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2232 transitions. [2025-03-08 08:32:47,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-03-08 08:32:47,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:47,468 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:47,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 08:32:47,468 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:47,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:47,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1973973388, now seen corresponding path program 1 times [2025-03-08 08:32:47,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:47,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296035943] [2025-03-08 08:32:47,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:47,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:47,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-03-08 08:32:47,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-03-08 08:32:47,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:47,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:47,986 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:47,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:47,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296035943] [2025-03-08 08:32:47,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296035943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:47,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:47,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:47,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771900967] [2025-03-08 08:32:47,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:47,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:47,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:47,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:47,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:47,988 INFO L87 Difference]: Start difference. First operand 1512 states and 2232 transitions. Second operand has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:48,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:48,650 INFO L93 Difference]: Finished difference Result 2730 states and 4024 transitions. [2025-03-08 08:32:48,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:48,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 1 states have call successors, (3), 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 370 [2025-03-08 08:32:48,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:48,653 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:48,653 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:48,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:48,654 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 4045 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4048 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:48,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4048 Valid, 3246 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:48,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:48,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:48,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4764432647644326) internal successors, (2225), 1507 states have internal predecessors, (2225), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2231 transitions. [2025-03-08 08:32:48,665 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2231 transitions. Word has length 370 [2025-03-08 08:32:48,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:48,667 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2231 transitions. [2025-03-08 08:32:48,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:48,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2231 transitions. [2025-03-08 08:32:48,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-08 08:32:48,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:48,668 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:48,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 08:32:48,668 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:48,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:48,669 INFO L85 PathProgramCache]: Analyzing trace with hash -977520797, now seen corresponding path program 1 times [2025-03-08 08:32:48,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:48,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889677194] [2025-03-08 08:32:48,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:48,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:48,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-08 08:32:48,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-08 08:32:48,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:48,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:49,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:49,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889677194] [2025-03-08 08:32:49,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889677194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:49,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:49,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:49,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663888666] [2025-03-08 08:32:49,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:49,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:49,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:49,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:49,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:49,111 INFO L87 Difference]: Start difference. First operand 1512 states and 2231 transitions. Second operand has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:49,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:49,697 INFO L93 Difference]: Finished difference Result 2730 states and 4022 transitions. [2025-03-08 08:32:49,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:49,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 1 states have call successors, (3), 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 371 [2025-03-08 08:32:49,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:49,699 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:49,699 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:49,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:49,702 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 2146 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2149 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:49,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2149 Valid, 3253 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:49,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:49,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.475779694757797) internal successors, (2224), 1507 states have internal predecessors, (2224), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2230 transitions. [2025-03-08 08:32:49,717 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2230 transitions. Word has length 371 [2025-03-08 08:32:49,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:49,717 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2230 transitions. [2025-03-08 08:32:49,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:49,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2230 transitions. [2025-03-08 08:32:49,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-08 08:32:49,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:49,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:49,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 08:32:49,720 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:49,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:49,720 INFO L85 PathProgramCache]: Analyzing trace with hash -838757007, now seen corresponding path program 1 times [2025-03-08 08:32:49,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:49,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564336743] [2025-03-08 08:32:49,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:49,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:49,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-08 08:32:49,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-08 08:32:49,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:49,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:50,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:50,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564336743] [2025-03-08 08:32:50,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564336743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:50,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:50,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:50,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304921077] [2025-03-08 08:32:50,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:50,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:50,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:50,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:50,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:50,220 INFO L87 Difference]: Start difference. First operand 1512 states and 2230 transitions. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:50,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:50,876 INFO L93 Difference]: Finished difference Result 2730 states and 4020 transitions. [2025-03-08 08:32:50,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:50,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 1 states have call successors, (3), 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 372 [2025-03-08 08:32:50,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:50,878 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:50,878 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:50,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:50,880 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 2142 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2145 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:50,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2145 Valid, 3253 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:50,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:50,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:50,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4751161247511613) internal successors, (2223), 1507 states have internal predecessors, (2223), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2229 transitions. [2025-03-08 08:32:50,891 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2229 transitions. Word has length 372 [2025-03-08 08:32:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:50,892 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2229 transitions. [2025-03-08 08:32:50,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:50,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2229 transitions. [2025-03-08 08:32:50,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-08 08:32:50,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:50,893 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:50,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 08:32:50,893 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:50,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:50,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1058480280, now seen corresponding path program 1 times [2025-03-08 08:32:50,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:50,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909149999] [2025-03-08 08:32:50,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:50,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:50,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-08 08:32:51,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-08 08:32:51,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:51,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:51,335 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:51,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:51,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909149999] [2025-03-08 08:32:51,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909149999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:51,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:51,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:51,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753602231] [2025-03-08 08:32:51,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:51,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:51,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:51,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:51,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:51,336 INFO L87 Difference]: Start difference. First operand 1512 states and 2229 transitions. Second operand has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:51,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:51,937 INFO L93 Difference]: Finished difference Result 2730 states and 4018 transitions. [2025-03-08 08:32:51,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:51,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 1 states have call successors, (3), 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 373 [2025-03-08 08:32:51,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:51,939 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:51,939 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:51,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:51,941 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 4021 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4024 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:51,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4024 Valid, 3246 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:51,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:51,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:51,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4744525547445255) internal successors, (2222), 1507 states have internal predecessors, (2222), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2228 transitions. [2025-03-08 08:32:51,979 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2228 transitions. Word has length 373 [2025-03-08 08:32:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:51,979 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2228 transitions. [2025-03-08 08:32:51,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2228 transitions. [2025-03-08 08:32:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-08 08:32:51,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:51,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:51,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 08:32:51,981 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:51,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:51,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2037741610, now seen corresponding path program 1 times [2025-03-08 08:32:51,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:51,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580170415] [2025-03-08 08:32:51,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:51,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:52,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-08 08:32:52,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-08 08:32:52,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:52,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:52,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:52,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580170415] [2025-03-08 08:32:52,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580170415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:52,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:52,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:52,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018255545] [2025-03-08 08:32:52,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:52,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:52,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:52,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:52,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:52,503 INFO L87 Difference]: Start difference. First operand 1512 states and 2228 transitions. Second operand has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:53,159 INFO L93 Difference]: Finished difference Result 2730 states and 4016 transitions. [2025-03-08 08:32:53,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:53,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 1 states have call successors, (3), 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 374 [2025-03-08 08:32:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:53,165 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:53,165 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:53,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:53,167 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 2134 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2137 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:53,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2137 Valid, 3253 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:53,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4737889847378898) internal successors, (2221), 1507 states have internal predecessors, (2221), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2227 transitions. [2025-03-08 08:32:53,181 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2227 transitions. Word has length 374 [2025-03-08 08:32:53,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:53,181 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2227 transitions. [2025-03-08 08:32:53,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2227 transitions. [2025-03-08 08:32:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-08 08:32:53,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:53,183 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:53,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 08:32:53,183 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:53,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:53,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1313948179, now seen corresponding path program 1 times [2025-03-08 08:32:53,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:53,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636784277] [2025-03-08 08:32:53,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:53,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:53,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-08 08:32:53,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-08 08:32:53,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:53,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:53,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:53,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636784277] [2025-03-08 08:32:53,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636784277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:53,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:53,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:53,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214514233] [2025-03-08 08:32:53,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:53,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:53,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:53,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:53,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:53,642 INFO L87 Difference]: Start difference. First operand 1512 states and 2227 transitions. Second operand has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:54,291 INFO L93 Difference]: Finished difference Result 2730 states and 4014 transitions. [2025-03-08 08:32:54,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:54,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 1 states have call successors, (3), 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 375 [2025-03-08 08:32:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:54,293 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:54,293 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:54,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:54,294 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 4005 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4008 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:54,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4008 Valid, 3246 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:54,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4731254147312542) internal successors, (2220), 1507 states have internal predecessors, (2220), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2226 transitions. [2025-03-08 08:32:54,304 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2226 transitions. Word has length 375 [2025-03-08 08:32:54,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:54,305 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2226 transitions. [2025-03-08 08:32:54,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2226 transitions. [2025-03-08 08:32:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-08 08:32:54,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:54,307 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:54,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 08:32:54,307 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:54,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:54,307 INFO L85 PathProgramCache]: Analyzing trace with hash -256276293, now seen corresponding path program 1 times [2025-03-08 08:32:54,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:54,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291823198] [2025-03-08 08:32:54,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:54,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:54,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-08 08:32:54,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-08 08:32:54,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:54,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:54,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:54,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291823198] [2025-03-08 08:32:54,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291823198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:54,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:54,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:54,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3414231] [2025-03-08 08:32:54,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:54,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:54,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:54,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:54,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:54,803 INFO L87 Difference]: Start difference. First operand 1512 states and 2226 transitions. Second operand has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:55,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:55,431 INFO L93 Difference]: Finished difference Result 2730 states and 4012 transitions. [2025-03-08 08:32:55,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:55,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 1 states have call successors, (3), 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 376 [2025-03-08 08:32:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:55,433 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:55,433 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:55,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:55,435 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 2126 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:55,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2129 Valid, 3253 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:55,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:55,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:55,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4724618447246185) internal successors, (2219), 1507 states have internal predecessors, (2219), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2225 transitions. [2025-03-08 08:32:55,447 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2225 transitions. Word has length 376 [2025-03-08 08:32:55,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:55,447 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2225 transitions. [2025-03-08 08:32:55,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:55,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2225 transitions. [2025-03-08 08:32:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-08 08:32:55,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:55,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:55,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 08:32:55,449 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:55,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1086188814, now seen corresponding path program 1 times [2025-03-08 08:32:55,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:55,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785046676] [2025-03-08 08:32:55,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:55,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:55,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-08 08:32:55,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-08 08:32:55,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:55,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:55,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:55,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785046676] [2025-03-08 08:32:55,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785046676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:55,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:55,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:55,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920411873] [2025-03-08 08:32:55,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:55,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:55,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:55,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:55,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:55,923 INFO L87 Difference]: Start difference. First operand 1512 states and 2225 transitions. Second operand has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:56,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:56,527 INFO L93 Difference]: Finished difference Result 2730 states and 4010 transitions. [2025-03-08 08:32:56,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:56,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 1 states have call successors, (3), 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 377 [2025-03-08 08:32:56,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:56,529 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:56,529 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:56,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:56,531 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 2119 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2122 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:56,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2122 Valid, 3253 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:56,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:56,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:56,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4717982747179827) internal successors, (2218), 1507 states have internal predecessors, (2218), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:56,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2224 transitions. [2025-03-08 08:32:56,542 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2224 transitions. Word has length 377 [2025-03-08 08:32:56,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:56,542 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2224 transitions. [2025-03-08 08:32:56,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:56,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2224 transitions. [2025-03-08 08:32:56,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-08 08:32:56,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:56,544 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:56,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 08:32:56,544 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:56,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:56,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1576150459, now seen corresponding path program 1 times [2025-03-08 08:32:56,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:56,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562771393] [2025-03-08 08:32:56,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:56,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:56,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-08 08:32:56,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-08 08:32:56,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:56,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32: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-08 08:32:57,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:57,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562771393] [2025-03-08 08:32:57,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562771393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:57,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:57,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:32:57,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005497689] [2025-03-08 08:32:57,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:57,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:32:57,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:57,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:32:57,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:32:57,263 INFO L87 Difference]: Start difference. First operand 1512 states and 2224 transitions. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:57,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:57,818 INFO L93 Difference]: Finished difference Result 2730 states and 4008 transitions. [2025-03-08 08:32:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:57,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 1 states have call successors, (3), 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 378 [2025-03-08 08:32:57,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:57,821 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:57,821 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:57,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:57,823 INFO L435 NwaCegarLoop]: 1718 mSDtfsCounter, 1962 mSDsluCounter, 1720 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 3438 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:57,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1962 Valid, 3438 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:32:57,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.471134704711347) internal successors, (2217), 1507 states have internal predecessors, (2217), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2223 transitions. [2025-03-08 08:32:57,841 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2223 transitions. Word has length 378 [2025-03-08 08:32:57,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:57,842 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2223 transitions. [2025-03-08 08:32:57,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:57,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2223 transitions. [2025-03-08 08:32:57,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-03-08 08:32:57,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:57,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:57,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 08:32:57,845 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:57,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:57,845 INFO L85 PathProgramCache]: Analyzing trace with hash 682919031, now seen corresponding path program 1 times [2025-03-08 08:32:57,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:57,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238294754] [2025-03-08 08:32:57,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:57,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:57,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-08 08:32:58,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-08 08:32:58,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:58,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:58,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:58,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238294754] [2025-03-08 08:32:58,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238294754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:58,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:58,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:58,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470337772] [2025-03-08 08:32:58,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:58,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:58,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:58,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:58,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:58,300 INFO L87 Difference]: Start difference. First operand 1512 states and 2223 transitions. Second operand has 5 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:58,876 INFO L93 Difference]: Finished difference Result 2758 states and 4047 transitions. [2025-03-08 08:32:58,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:32:58,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 1 states have call successors, (3), 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 379 [2025-03-08 08:32:58,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:58,878 INFO L225 Difference]: With dead ends: 2758 [2025-03-08 08:32:58,878 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:58,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:32:58,879 INFO L435 NwaCegarLoop]: 1828 mSDtfsCounter, 2017 mSDsluCounter, 3550 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 5378 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:58,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 5378 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:32:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:58,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:58,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4704711347047112) internal successors, (2216), 1507 states have internal predecessors, (2216), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2222 transitions. [2025-03-08 08:32:58,893 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2222 transitions. Word has length 379 [2025-03-08 08:32:58,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:58,893 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2222 transitions. [2025-03-08 08:32:58,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2222 transitions. [2025-03-08 08:32:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-03-08 08:32:58,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:58,895 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:58,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 08:32:58,895 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:58,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:58,896 INFO L85 PathProgramCache]: Analyzing trace with hash 2113356725, now seen corresponding path program 1 times [2025-03-08 08:32:58,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:58,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49141709] [2025-03-08 08:32:58,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:58,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:58,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-08 08:32:59,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-08 08:32:59,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:59,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:59,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:32:59,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:59,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49141709] [2025-03-08 08:32:59,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49141709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:59,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:59,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:59,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849496414] [2025-03-08 08:32:59,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:59,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:59,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:59,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:59,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:59,316 INFO L87 Difference]: Start difference. First operand 1512 states and 2222 transitions. Second operand has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:59,817 INFO L93 Difference]: Finished difference Result 2730 states and 4004 transitions. [2025-03-08 08:32:59,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:59,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 1 states have call successors, (3), 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 380 [2025-03-08 08:32:59,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:59,819 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:32:59,819 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:32:59,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:59,821 INFO L435 NwaCegarLoop]: 1718 mSDtfsCounter, 4189 mSDsluCounter, 1720 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4192 SdHoareTripleChecker+Valid, 3438 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:59,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4192 Valid, 3438 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:32:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:32:59,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:32:59,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4698075646980757) internal successors, (2215), 1507 states have internal predecessors, (2215), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:32:59,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2221 transitions. [2025-03-08 08:32:59,833 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2221 transitions. Word has length 380 [2025-03-08 08:32:59,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:59,833 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2221 transitions. [2025-03-08 08:32:59,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:32:59,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2221 transitions. [2025-03-08 08:32:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-03-08 08:32:59,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:59,835 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:59,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 08:32:59,835 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:59,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:59,836 INFO L85 PathProgramCache]: Analyzing trace with hash -379900804, now seen corresponding path program 1 times [2025-03-08 08:32:59,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:59,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943325750] [2025-03-08 08:32:59,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:59,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:59,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-03-08 08:32:59,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-03-08 08:32:59,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:59,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:33:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:33:00,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:33:00,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943325750] [2025-03-08 08:33:00,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943325750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:33:00,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:33:00,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:33:00,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764930560] [2025-03-08 08:33:00,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:33:00,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:33:00,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:33:00,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:33:00,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:33:00,291 INFO L87 Difference]: Start difference. First operand 1512 states and 2221 transitions. Second operand has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:00,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:33:00,795 INFO L93 Difference]: Finished difference Result 2730 states and 4002 transitions. [2025-03-08 08:33:00,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:33:00,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 1 states have call successors, (3), 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 381 [2025-03-08 08:33:00,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:33:00,797 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:33:00,797 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:33:00,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:33:00,799 INFO L435 NwaCegarLoop]: 1718 mSDtfsCounter, 4181 mSDsluCounter, 1720 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4184 SdHoareTripleChecker+Valid, 3438 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:33:00,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4184 Valid, 3438 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:33:00,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:33:00,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:33:00,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.46914399469144) internal successors, (2214), 1507 states have internal predecessors, (2214), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:33:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2220 transitions. [2025-03-08 08:33:00,813 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2220 transitions. Word has length 381 [2025-03-08 08:33:00,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:33:00,813 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2220 transitions. [2025-03-08 08:33:00,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:00,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2220 transitions. [2025-03-08 08:33:00,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-03-08 08:33:00,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:33:00,814 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:33:00,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 08:33:00,815 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:33:00,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:33:00,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1502636570, now seen corresponding path program 1 times [2025-03-08 08:33:00,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:33:00,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422717135] [2025-03-08 08:33:00,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:33:00,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:33:00,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-08 08:33:00,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-08 08:33:00,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:33:00,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:33:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:33:01,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:33:01,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422717135] [2025-03-08 08:33:01,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422717135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:33:01,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:33:01,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:33:01,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018914426] [2025-03-08 08:33:01,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:33:01,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:33:01,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:33:01,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:33:01,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:33:01,350 INFO L87 Difference]: Start difference. First operand 1512 states and 2220 transitions. Second operand has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:01,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:33:01,891 INFO L93 Difference]: Finished difference Result 2730 states and 4000 transitions. [2025-03-08 08:33:01,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:33:01,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 1 states have call successors, (3), 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 382 [2025-03-08 08:33:01,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:33:01,893 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:33:01,893 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:33:01,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:33:01,895 INFO L435 NwaCegarLoop]: 1718 mSDtfsCounter, 2198 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2201 SdHoareTripleChecker+Valid, 3445 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:33:01,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2201 Valid, 3445 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:33:01,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:33:01,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:33:01,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4684804246848042) internal successors, (2213), 1507 states have internal predecessors, (2213), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:33:01,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2219 transitions. [2025-03-08 08:33:01,906 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2219 transitions. Word has length 382 [2025-03-08 08:33:01,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:33:01,906 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2219 transitions. [2025-03-08 08:33:01,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:01,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2219 transitions. [2025-03-08 08:33:01,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-08 08:33:01,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:33:01,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:33:01,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 08:33:01,908 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:33:01,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:33:01,909 INFO L85 PathProgramCache]: Analyzing trace with hash -950105343, now seen corresponding path program 1 times [2025-03-08 08:33:01,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:33:01,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605265450] [2025-03-08 08:33:01,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:33:01,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:33:01,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-08 08:33:02,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-08 08:33:02,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:33:02,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:33:02,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-08 08:33:02,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:33:02,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605265450] [2025-03-08 08:33:02,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605265450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:33:02,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:33:02,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:33:02,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465970460] [2025-03-08 08:33:02,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:33:02,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:33:02,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:33:02,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:33:02,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:33:02,362 INFO L87 Difference]: Start difference. First operand 1512 states and 2219 transitions. Second operand has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:02,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:33:02,870 INFO L93 Difference]: Finished difference Result 2730 states and 3998 transitions. [2025-03-08 08:33:02,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:33:02,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 1 states have call successors, (3), 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 383 [2025-03-08 08:33:02,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:33:02,872 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:33:02,872 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:33:02,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:33:02,873 INFO L435 NwaCegarLoop]: 1718 mSDtfsCounter, 4165 mSDsluCounter, 1720 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4168 SdHoareTripleChecker+Valid, 3438 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:33:02,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4168 Valid, 3438 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:33:02,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:33:02,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:33:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4678168546781685) internal successors, (2212), 1507 states have internal predecessors, (2212), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:33:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2218 transitions. [2025-03-08 08:33:02,884 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2218 transitions. Word has length 383 [2025-03-08 08:33:02,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:33:02,884 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2218 transitions. [2025-03-08 08:33:02,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2218 transitions. [2025-03-08 08:33:02,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-03-08 08:33:02,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:33:02,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:33:02,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 08:33:02,886 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:33:02,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:33:02,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1128915201, now seen corresponding path program 1 times [2025-03-08 08:33:02,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:33:02,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106582815] [2025-03-08 08:33:02,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:33:02,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:33:02,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-03-08 08:33:03,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-03-08 08:33:03,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:33:03,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:33:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:33:03,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:33:03,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106582815] [2025-03-08 08:33:03,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106582815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:33:03,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:33:03,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:33:03,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756664069] [2025-03-08 08:33:03,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:33:03,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:33:03,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:33:03,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:33:03,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:33:03,308 INFO L87 Difference]: Start difference. First operand 1512 states and 2218 transitions. Second operand has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:03,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:33:03,823 INFO L93 Difference]: Finished difference Result 2730 states and 3996 transitions. [2025-03-08 08:33:03,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:33:03,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 1 states have call successors, (3), 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 384 [2025-03-08 08:33:03,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:33:03,825 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:33:03,825 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:33:03,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:33:03,827 INFO L435 NwaCegarLoop]: 1718 mSDtfsCounter, 2190 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2193 SdHoareTripleChecker+Valid, 3445 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:33:03,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2193 Valid, 3445 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:33:03,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:33:03,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:33:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.467153284671533) internal successors, (2211), 1507 states have internal predecessors, (2211), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:33:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2217 transitions. [2025-03-08 08:33:03,837 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2217 transitions. Word has length 384 [2025-03-08 08:33:03,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:33:03,837 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2217 transitions. [2025-03-08 08:33:03,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:03,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2217 transitions. [2025-03-08 08:33:03,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-03-08 08:33:03,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:33:03,839 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:33:03,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-08 08:33:03,839 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:33:03,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:33:03,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1261248506, now seen corresponding path program 1 times [2025-03-08 08:33:03,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:33:03,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535013333] [2025-03-08 08:33:03,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:33:03,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:33:03,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-03-08 08:33:04,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-03-08 08:33:04,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:33:04,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:33:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:33:04,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:33:04,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535013333] [2025-03-08 08:33:04,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535013333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:33:04,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:33:04,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:33:04,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569941732] [2025-03-08 08:33:04,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:33:04,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:33:04,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:33:04,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:33:04,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:33:04,270 INFO L87 Difference]: Start difference. First operand 1512 states and 2217 transitions. Second operand has 5 states, 5 states have (on average 74.6) internal successors, (373), 5 states have internal predecessors, (373), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:04,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:33:04,769 INFO L93 Difference]: Finished difference Result 2730 states and 3994 transitions. [2025-03-08 08:33:04,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:33:04,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 74.6) internal successors, (373), 5 states have internal predecessors, (373), 1 states have call successors, (3), 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 385 [2025-03-08 08:33:04,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:33:04,770 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:33:04,770 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:33:04,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:33:04,772 INFO L435 NwaCegarLoop]: 1718 mSDtfsCounter, 4149 mSDsluCounter, 1720 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4152 SdHoareTripleChecker+Valid, 3438 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:33:04,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4152 Valid, 3438 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:33:04,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:33:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:33:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4664897146648972) internal successors, (2210), 1507 states have internal predecessors, (2210), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:33:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2216 transitions. [2025-03-08 08:33:04,781 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2216 transitions. Word has length 385 [2025-03-08 08:33:04,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:33:04,782 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2216 transitions. [2025-03-08 08:33:04,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.6) internal successors, (373), 5 states have internal predecessors, (373), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:04,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2216 transitions. [2025-03-08 08:33:04,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-08 08:33:04,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:33:04,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:33:04,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-08 08:33:04,783 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:33:04,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:33:04,783 INFO L85 PathProgramCache]: Analyzing trace with hash 90088036, now seen corresponding path program 1 times [2025-03-08 08:33:04,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:33:04,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496829332] [2025-03-08 08:33:04,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:33:04,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:33:04,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-08 08:33:04,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-08 08:33:04,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:33:04,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:33:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:33:05,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:33:05,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496829332] [2025-03-08 08:33:05,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496829332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:33:05,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:33:05,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:33:05,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96043478] [2025-03-08 08:33:05,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:33:05,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:33:05,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:33:05,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:33:05,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:33:05,219 INFO L87 Difference]: Start difference. First operand 1512 states and 2216 transitions. Second operand has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:05,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:33:05,793 INFO L93 Difference]: Finished difference Result 2730 states and 3992 transitions. [2025-03-08 08:33:05,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:33:05,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 1 states have call successors, (3), 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 386 [2025-03-08 08:33:05,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:33:05,795 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:33:05,795 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:33:05,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:33:05,796 INFO L435 NwaCegarLoop]: 1718 mSDtfsCounter, 2182 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2185 SdHoareTripleChecker+Valid, 3445 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:33:05,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2185 Valid, 3445 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:33:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:33:05,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:33:05,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4658261446582614) internal successors, (2209), 1507 states have internal predecessors, (2209), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:33:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2215 transitions. [2025-03-08 08:33:05,807 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2215 transitions. Word has length 386 [2025-03-08 08:33:05,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:33:05,807 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2215 transitions. [2025-03-08 08:33:05,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:05,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2215 transitions. [2025-03-08 08:33:05,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-03-08 08:33:05,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:33:05,808 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:33:05,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-08 08:33:05,808 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:33:05,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:33:05,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1632867445, now seen corresponding path program 1 times [2025-03-08 08:33:05,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:33:05,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759082756] [2025-03-08 08:33:05,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:33:05,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:33:05,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-08 08:33:05,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-08 08:33:05,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:33:05,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:33:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:33:06,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:33:06,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759082756] [2025-03-08 08:33:06,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759082756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:33:06,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:33:06,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:33:06,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317548105] [2025-03-08 08:33:06,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:33:06,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:33:06,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:33:06,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:33:06,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:33:06,289 INFO L87 Difference]: Start difference. First operand 1512 states and 2215 transitions. Second operand has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:33:06,830 INFO L93 Difference]: Finished difference Result 2730 states and 3990 transitions. [2025-03-08 08:33:06,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:33:06,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 1 states have call successors, (3), 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 387 [2025-03-08 08:33:06,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:33:06,833 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:33:06,833 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:33:06,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:33:06,834 INFO L435 NwaCegarLoop]: 1718 mSDtfsCounter, 2178 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2181 SdHoareTripleChecker+Valid, 3445 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:33:06,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2181 Valid, 3445 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:33:06,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:33:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:33:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4651625746516257) internal successors, (2208), 1507 states have internal predecessors, (2208), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:33:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2214 transitions. [2025-03-08 08:33:06,849 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2214 transitions. Word has length 387 [2025-03-08 08:33:06,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:33:06,850 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2214 transitions. [2025-03-08 08:33:06,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2214 transitions. [2025-03-08 08:33:06,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-03-08 08:33:06,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:33:06,853 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:33:06,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-08 08:33:06,853 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:33:06,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:33:06,853 INFO L85 PathProgramCache]: Analyzing trace with hash 400569417, now seen corresponding path program 1 times [2025-03-08 08:33:06,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:33:06,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824152623] [2025-03-08 08:33:06,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:33:06,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:33:06,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-03-08 08:33:07,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-03-08 08:33:07,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:33:07,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:33:07,350 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:33:07,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:33:07,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824152623] [2025-03-08 08:33:07,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824152623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:33:07,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:33:07,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:33:07,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912303063] [2025-03-08 08:33:07,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:33:07,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:33:07,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:33:07,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:33:07,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:33:07,351 INFO L87 Difference]: Start difference. First operand 1512 states and 2214 transitions. Second operand has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:33:07,861 INFO L93 Difference]: Finished difference Result 2730 states and 3988 transitions. [2025-03-08 08:33:07,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:33:07,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 1 states have call successors, (3), 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 388 [2025-03-08 08:33:07,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:33:07,863 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:33:07,863 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:33:07,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:33:07,864 INFO L435 NwaCegarLoop]: 1718 mSDtfsCounter, 2174 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2177 SdHoareTripleChecker+Valid, 3445 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:33:07,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2177 Valid, 3445 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:33:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:33:07,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:33:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.46449900464499) internal successors, (2207), 1507 states have internal predecessors, (2207), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:33:07,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2213 transitions. [2025-03-08 08:33:07,874 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2213 transitions. Word has length 388 [2025-03-08 08:33:07,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:33:07,874 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2213 transitions. [2025-03-08 08:33:07,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:07,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2213 transitions. [2025-03-08 08:33:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-03-08 08:33:07,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:33:07,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:33:07,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-08 08:33:07,876 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:33:07,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:33:07,876 INFO L85 PathProgramCache]: Analyzing trace with hash 750742928, now seen corresponding path program 1 times [2025-03-08 08:33:07,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:33:07,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194237599] [2025-03-08 08:33:07,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:33:07,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:33:07,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-03-08 08:33:08,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-03-08 08:33:08,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:33:08,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:33:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:33:08,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:33:08,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194237599] [2025-03-08 08:33:08,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194237599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:33:08,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:33:08,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:33:08,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944148372] [2025-03-08 08:33:08,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:33:08,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:33:08,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:33:08,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:33:08,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:33:08,346 INFO L87 Difference]: Start difference. First operand 1512 states and 2213 transitions. Second operand has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:08,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:33:08,841 INFO L93 Difference]: Finished difference Result 2730 states and 3986 transitions. [2025-03-08 08:33:08,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:33:08,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 1 states have call successors, (3), 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 389 [2025-03-08 08:33:08,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:33:08,843 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:33:08,843 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:33:08,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:33:08,844 INFO L435 NwaCegarLoop]: 1718 mSDtfsCounter, 2170 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2173 SdHoareTripleChecker+Valid, 3445 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:33:08,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2173 Valid, 3445 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:33:08,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:33:08,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:33:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4638354346383544) internal successors, (2206), 1507 states have internal predecessors, (2206), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:33:08,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2212 transitions. [2025-03-08 08:33:08,854 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2212 transitions. Word has length 389 [2025-03-08 08:33:08,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:33:08,854 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2212 transitions. [2025-03-08 08:33:08,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2212 transitions. [2025-03-08 08:33:08,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-03-08 08:33:08,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:33:08,856 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:33:08,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-08 08:33:08,856 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:33:08,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:33:08,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1055986862, now seen corresponding path program 1 times [2025-03-08 08:33:08,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:33:08,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039579725] [2025-03-08 08:33:08,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:33:08,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:33:08,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-08 08:33:09,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-08 08:33:09,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:33:09,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:33:09,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:33:09,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:33:09,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039579725] [2025-03-08 08:33:09,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039579725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:33:09,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:33:09,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:33:09,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288861995] [2025-03-08 08:33:09,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:33:09,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:33:09,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:33:09,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:33:09,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:33:09,289 INFO L87 Difference]: Start difference. First operand 1512 states and 2212 transitions. Second operand has 5 states, 5 states have (on average 75.6) internal successors, (378), 5 states have internal predecessors, (378), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:33:09,796 INFO L93 Difference]: Finished difference Result 2730 states and 3984 transitions. [2025-03-08 08:33:09,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:33:09,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.6) internal successors, (378), 5 states have internal predecessors, (378), 1 states have call successors, (3), 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 390 [2025-03-08 08:33:09,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:33:09,797 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:33:09,797 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:33:09,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:33:09,798 INFO L435 NwaCegarLoop]: 1718 mSDtfsCounter, 4109 mSDsluCounter, 1720 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4112 SdHoareTripleChecker+Valid, 3438 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:33:09,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4112 Valid, 3438 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:33:09,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:33:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:33:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4631718646317187) internal successors, (2205), 1507 states have internal predecessors, (2205), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:33:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2211 transitions. [2025-03-08 08:33:09,808 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2211 transitions. Word has length 390 [2025-03-08 08:33:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:33:09,809 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2211 transitions. [2025-03-08 08:33:09,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.6) internal successors, (378), 5 states have internal predecessors, (378), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2211 transitions. [2025-03-08 08:33:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-08 08:33:09,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:33:09,810 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:33:09,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-08 08:33:09,810 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:33:09,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:33:09,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2118113771, now seen corresponding path program 1 times [2025-03-08 08:33:09,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:33:09,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582245108] [2025-03-08 08:33:09,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:33:09,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:33:09,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-08 08:33:09,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-08 08:33:09,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:33:09,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:33:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:33:10,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:33:10,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582245108] [2025-03-08 08:33:10,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582245108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:33:10,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:33:10,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:33:10,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616145989] [2025-03-08 08:33:10,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:33:10,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:33:10,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:33:10,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:33:10,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:33:10,244 INFO L87 Difference]: Start difference. First operand 1512 states and 2211 transitions. Second operand has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:10,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:33:10,728 INFO L93 Difference]: Finished difference Result 2730 states and 3982 transitions. [2025-03-08 08:33:10,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:33:10,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 1 states have call successors, (3), 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 391 [2025-03-08 08:33:10,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:33:10,730 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:33:10,730 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:33:10,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:33:10,731 INFO L435 NwaCegarLoop]: 1718 mSDtfsCounter, 2162 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2165 SdHoareTripleChecker+Valid, 3445 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:33:10,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2165 Valid, 3445 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:33:10,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:33:10,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:33:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.462508294625083) internal successors, (2204), 1507 states have internal predecessors, (2204), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:33:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2210 transitions. [2025-03-08 08:33:10,742 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2210 transitions. Word has length 391 [2025-03-08 08:33:10,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:33:10,742 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2210 transitions. [2025-03-08 08:33:10,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:10,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2210 transitions. [2025-03-08 08:33:10,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-03-08 08:33:10,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:33:10,743 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:33:10,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-08 08:33:10,744 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:33:10,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:33:10,744 INFO L85 PathProgramCache]: Analyzing trace with hash 195527571, now seen corresponding path program 1 times [2025-03-08 08:33:10,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:33:10,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684728258] [2025-03-08 08:33:10,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:33:10,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:33:10,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-08 08:33:10,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-08 08:33:10,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:33:10,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:33:11,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-08 08:33:11,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:33:11,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684728258] [2025-03-08 08:33:11,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684728258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:33:11,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:33:11,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:33:11,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694574741] [2025-03-08 08:33:11,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:33:11,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:33:11,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:33:11,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:33:11,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:33:11,204 INFO L87 Difference]: Start difference. First operand 1512 states and 2210 transitions. Second operand has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:33:11,694 INFO L93 Difference]: Finished difference Result 2730 states and 3980 transitions. [2025-03-08 08:33:11,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:33:11,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 1 states have call successors, (3), 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 392 [2025-03-08 08:33:11,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:33:11,695 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:33:11,695 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:33:11,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:33:11,696 INFO L435 NwaCegarLoop]: 1718 mSDtfsCounter, 2158 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 3445 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:33:11,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2161 Valid, 3445 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:33:11,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:33:11,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:33:11,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4618447246184472) internal successors, (2203), 1507 states have internal predecessors, (2203), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:33:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2209 transitions. [2025-03-08 08:33:11,707 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2209 transitions. Word has length 392 [2025-03-08 08:33:11,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:33:11,707 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2209 transitions. [2025-03-08 08:33:11,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:11,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2209 transitions. [2025-03-08 08:33:11,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-03-08 08:33:11,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:33:11,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:33:11,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-08 08:33:11,709 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:33:11,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:33:11,709 INFO L85 PathProgramCache]: Analyzing trace with hash -79506150, now seen corresponding path program 1 times [2025-03-08 08:33:11,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:33:11,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114810140] [2025-03-08 08:33:11,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:33:11,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:33:11,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-03-08 08:33:11,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-03-08 08:33:11,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:33:11,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:33:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:33:12,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:33:12,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114810140] [2025-03-08 08:33:12,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114810140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:33:12,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:33:12,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:33:12,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836438106] [2025-03-08 08:33:12,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:33:12,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:33:12,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:33:12,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:33:12,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:33:12,166 INFO L87 Difference]: Start difference. First operand 1512 states and 2209 transitions. Second operand has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:33:12,690 INFO L93 Difference]: Finished difference Result 2730 states and 3978 transitions. [2025-03-08 08:33:12,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:33:12,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 1 states have call successors, (3), 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 393 [2025-03-08 08:33:12,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:33:12,691 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:33:12,691 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:33:12,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:33:12,692 INFO L435 NwaCegarLoop]: 1718 mSDtfsCounter, 2151 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2154 SdHoareTripleChecker+Valid, 3445 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:33:12,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2154 Valid, 3445 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:33:12,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:33:12,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:33:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4611811546118116) internal successors, (2202), 1507 states have internal predecessors, (2202), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:33:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2208 transitions. [2025-03-08 08:33:12,702 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2208 transitions. Word has length 393 [2025-03-08 08:33:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:33:12,702 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2208 transitions. [2025-03-08 08:33:12,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2208 transitions. [2025-03-08 08:33:12,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-03-08 08:33:12,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:33:12,703 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:33:12,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-08 08:33:12,704 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:33:12,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:33:12,704 INFO L85 PathProgramCache]: Analyzing trace with hash 160926355, now seen corresponding path program 1 times [2025-03-08 08:33:12,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:33:12,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840336370] [2025-03-08 08:33:12,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:33:12,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:33:12,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-03-08 08:33:12,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-03-08 08:33:12,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:33:12,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:33:13,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 08:33:13,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:33:13,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840336370] [2025-03-08 08:33:13,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840336370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:33:13,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:33:13,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:33:13,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746290936] [2025-03-08 08:33:13,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:33:13,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:33:13,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:33:13,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:33:13,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:33:13,292 INFO L87 Difference]: Start difference. First operand 1512 states and 2208 transitions. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:13,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:33:13,720 INFO L93 Difference]: Finished difference Result 2730 states and 3976 transitions. [2025-03-08 08:33:13,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:33:13,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 1 states have call successors, (3), 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 394 [2025-03-08 08:33:13,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:33:13,722 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 08:33:13,722 INFO L226 Difference]: Without dead ends: 1512 [2025-03-08 08:33:13,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:33:13,723 INFO L435 NwaCegarLoop]: 1798 mSDtfsCounter, 1994 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1994 SdHoareTripleChecker+Valid, 3598 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 08:33:13,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1994 Valid, 3598 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 08:33:13,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-08 08:33:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-03-08 08:33:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.460517584605176) internal successors, (2201), 1507 states have internal predecessors, (2201), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 08:33:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2207 transitions. [2025-03-08 08:33:13,735 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2207 transitions. Word has length 394 [2025-03-08 08:33:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:33:13,735 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2207 transitions. [2025-03-08 08:33:13,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 08:33:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2207 transitions. [2025-03-08 08:33:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2025-03-08 08:33:13,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:33:13,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:33:13,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-08 08:33:13,737 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:33:13,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:33:13,737 INFO L85 PathProgramCache]: Analyzing trace with hash 741258183, now seen corresponding path program 1 times [2025-03-08 08:33:13,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:33:13,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435422426] [2025-03-08 08:33:13,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:33:13,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:33:13,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-03-08 08:33:13,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-03-08 08:33:13,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:33:13,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat