./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label35.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash e81bbc4430f76a90c5e02a887d03761648c221c2fd9f1be76d3af26cf9b24c3e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:19:11,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:19:11,548 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:19:11,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:19:11,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:19:11,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:19:11,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:19:11,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:19:11,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:19:11,579 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:19:11,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:19:11,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:19:11,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:19:11,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:19:11,580 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:19:11,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:19:11,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:19:11,580 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:19:11,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:19:11,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:19:11,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:19:11,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:19:11,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:19:11,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:19:11,580 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:19:11,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:19:11,580 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:19:11,580 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:19:11,580 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:19:11,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:19:11,581 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:19:11,581 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:19:11,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:19:11,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:19:11,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:19:11,581 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:19:11,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:19:11,581 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:19:11,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:19:11,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:19:11,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:19:11,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:19:11,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:19:11,581 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e81bbc4430f76a90c5e02a887d03761648c221c2fd9f1be76d3af26cf9b24c3e [2025-03-16 15:19:11,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:19:11,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:19:11,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:19:11,787 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:19:11,787 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:19:11,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label35.c [2025-03-16 15:19:12,958 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa078e133/bd4574fb984e4d6cb024fdf46775f506/FLAGcfec5e2aa [2025-03-16 15:19:13,339 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:19:13,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label35.c [2025-03-16 15:19:13,365 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa078e133/bd4574fb984e4d6cb024fdf46775f506/FLAGcfec5e2aa [2025-03-16 15:19:13,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa078e133/bd4574fb984e4d6cb024fdf46775f506 [2025-03-16 15:19:13,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:19:13,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:19:13,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:19:13,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:19:13,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:19:13,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:19:13" (1/1) ... [2025-03-16 15:19:13,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@209ccd49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:13, skipping insertion in model container [2025-03-16 15:19:13,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:19:13" (1/1) ... [2025-03-16 15:19:13,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:19:13,594 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/eca-rers2012/Problem17_label35.c[1267,1280] [2025-03-16 15:19:13,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:19:13,941 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:19:13,949 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/eca-rers2012/Problem17_label35.c[1267,1280] [2025-03-16 15:19:14,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:19:14,149 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:19:14,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:14 WrapperNode [2025-03-16 15:19:14,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:19:14,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:19:14,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:19:14,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:19:14,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:14" (1/1) ... [2025-03-16 15:19:14,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:14" (1/1) ... [2025-03-16 15:19:14,360 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-16 15:19:14,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:19:14,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:19:14,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:19:14,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:19:14,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:14" (1/1) ... [2025-03-16 15:19:14,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:14" (1/1) ... [2025-03-16 15:19:14,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:14" (1/1) ... [2025-03-16 15:19:14,511 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:19:14,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:14" (1/1) ... [2025-03-16 15:19:14,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:14" (1/1) ... [2025-03-16 15:19:14,567 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:14" (1/1) ... [2025-03-16 15:19:14,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:14" (1/1) ... [2025-03-16 15:19:14,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:14" (1/1) ... [2025-03-16 15:19:14,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:14" (1/1) ... [2025-03-16 15:19:14,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:19:14,630 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:19:14,630 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:19:14,630 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:19:14,631 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:14" (1/1) ... [2025-03-16 15:19:14,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:19:14,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:19:14,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:19:14,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:19:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:19:14,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:19:14,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:19:14,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:19:14,716 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:19:14,717 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:19:17,232 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-16 15:19:17,318 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-16 15:19:17,318 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:19:17,342 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:19:17,342 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:19:17,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:19:17 BoogieIcfgContainer [2025-03-16 15:19:17,345 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:19:17,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:19:17,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:19:17,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:19:17,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:19:13" (1/3) ... [2025-03-16 15:19:17,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b7a81d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:19:17, skipping insertion in model container [2025-03-16 15:19:17,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:14" (2/3) ... [2025-03-16 15:19:17,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b7a81d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:19:17, skipping insertion in model container [2025-03-16 15:19:17,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:19:17" (3/3) ... [2025-03-16 15:19:17,354 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label35.c [2025-03-16 15:19:17,366 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:19:17,368 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label35.c that has 1 procedures, 529 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:19:17,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:19:17,438 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;@17441535, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:19:17,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:19:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:17,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-16 15:19:17,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:17,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-16 15:19:17,447 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:17,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:17,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1593945927, now seen corresponding path program 1 times [2025-03-16 15:19:17,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:17,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833648896] [2025-03-16 15:19:17,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:17,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:17,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 15:19:17,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 15:19:17,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:17,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:17,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:19:17,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:17,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833648896] [2025-03-16 15:19:17,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833648896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:17,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:17,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:19:17,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842769371] [2025-03-16 15:19:17,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:17,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:17,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:17,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:17,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:17,624 INFO L87 Difference]: Start difference. First operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:19,497 INFO L93 Difference]: Finished difference Result 1508 states and 2887 transitions. [2025-03-16 15:19:19,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:19,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-16 15:19:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:19,509 INFO L225 Difference]: With dead ends: 1508 [2025-03-16 15:19:19,509 INFO L226 Difference]: Without dead ends: 974 [2025-03-16 15:19:19,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:19,513 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 470 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:19,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 503 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:19:19,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-16 15:19:19,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 971. [2025-03-16 15:19:19,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5082474226804123) internal successors, (1463), 970 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1463 transitions. [2025-03-16 15:19:19,595 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1463 transitions. Word has length 6 [2025-03-16 15:19:19,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:19,596 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1463 transitions. [2025-03-16 15:19:19,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1463 transitions. [2025-03-16 15:19:19,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 15:19:19,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:19,597 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:19,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:19:19,597 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:19,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:19,598 INFO L85 PathProgramCache]: Analyzing trace with hash -664851375, now seen corresponding path program 1 times [2025-03-16 15:19:19,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:19,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558295796] [2025-03-16 15:19:19,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:19,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:19,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 15:19:19,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 15:19:19,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:19,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:19:19,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:19,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558295796] [2025-03-16 15:19:19,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558295796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:19,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:19,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:19,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774808079] [2025-03-16 15:19:19,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:19,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:19,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:19,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:19,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:19,918 INFO L87 Difference]: Start difference. First operand 971 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:21,610 INFO L93 Difference]: Finished difference Result 2813 states and 4241 transitions. [2025-03-16 15:19:21,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:21,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 15:19:21,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:21,632 INFO L225 Difference]: With dead ends: 2813 [2025-03-16 15:19:21,633 INFO L226 Difference]: Without dead ends: 1843 [2025-03-16 15:19:21,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:21,635 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 484 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:21,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 919 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:19:21,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2025-03-16 15:19:21,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1841. [2025-03-16 15:19:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.3603260869565217) internal successors, (2503), 1840 states have internal predecessors, (2503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2503 transitions. [2025-03-16 15:19:21,666 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2503 transitions. Word has length 76 [2025-03-16 15:19:21,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:21,666 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2503 transitions. [2025-03-16 15:19:21,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2503 transitions. [2025-03-16 15:19:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 15:19:21,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:21,669 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:21,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:19:21,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:21,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:21,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1193639812, now seen corresponding path program 1 times [2025-03-16 15:19:21,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:21,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685972565] [2025-03-16 15:19:21,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:21,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:21,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 15:19:21,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 15:19:21,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:21,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:19:21,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:21,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685972565] [2025-03-16 15:19:21,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685972565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:21,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:21,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:19:21,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134799999] [2025-03-16 15:19:21,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:21,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:21,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:21,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:21,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:21,829 INFO L87 Difference]: Start difference. First operand 1841 states and 2503 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:23,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:23,397 INFO L93 Difference]: Finished difference Result 5394 states and 7325 transitions. [2025-03-16 15:19:23,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:23,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-16 15:19:23,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:23,404 INFO L225 Difference]: With dead ends: 5394 [2025-03-16 15:19:23,404 INFO L226 Difference]: Without dead ends: 2700 [2025-03-16 15:19:23,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:23,407 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:23,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:19:23,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2025-03-16 15:19:23,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2700. [2025-03-16 15:19:23,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2699 states have (on average 1.1919229344201556) internal successors, (3217), 2699 states have internal predecessors, (3217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3217 transitions. [2025-03-16 15:19:23,440 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3217 transitions. Word has length 98 [2025-03-16 15:19:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:23,441 INFO L471 AbstractCegarLoop]: Abstraction has 2700 states and 3217 transitions. [2025-03-16 15:19:23,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3217 transitions. [2025-03-16 15:19:23,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-16 15:19:23,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:23,446 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:23,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:19:23,446 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:23,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:23,446 INFO L85 PathProgramCache]: Analyzing trace with hash 278604340, now seen corresponding path program 1 times [2025-03-16 15:19:23,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:23,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002132342] [2025-03-16 15:19:23,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:23,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:23,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-16 15:19:23,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-16 15:19:23,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:23,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:19:23,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:23,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002132342] [2025-03-16 15:19:23,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002132342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:23,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:23,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:23,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879172406] [2025-03-16 15:19:23,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:23,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:23,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:23,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:23,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:23,672 INFO L87 Difference]: Start difference. First operand 2700 states and 3217 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:25,118 INFO L93 Difference]: Finished difference Result 7107 states and 8597 transitions. [2025-03-16 15:19:25,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:25,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2025-03-16 15:19:25,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:25,131 INFO L225 Difference]: With dead ends: 7107 [2025-03-16 15:19:25,131 INFO L226 Difference]: Without dead ends: 4408 [2025-03-16 15:19:25,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:25,135 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:25,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 782 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:19:25,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2025-03-16 15:19:25,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 4408. [2025-03-16 15:19:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4408 states, 4407 states have (on average 1.1706376219650556) internal successors, (5159), 4407 states have internal predecessors, (5159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4408 states to 4408 states and 5159 transitions. [2025-03-16 15:19:25,185 INFO L78 Accepts]: Start accepts. Automaton has 4408 states and 5159 transitions. Word has length 158 [2025-03-16 15:19:25,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:25,186 INFO L471 AbstractCegarLoop]: Abstraction has 4408 states and 5159 transitions. [2025-03-16 15:19:25,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 4408 states and 5159 transitions. [2025-03-16 15:19:25,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-16 15:19:25,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:25,188 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:25,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:19:25,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:25,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:25,189 INFO L85 PathProgramCache]: Analyzing trace with hash -736898951, now seen corresponding path program 1 times [2025-03-16 15:19:25,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:25,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583936586] [2025-03-16 15:19:25,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:25,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:25,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-16 15:19:25,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-16 15:19:25,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:25,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 15:19:25,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:25,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583936586] [2025-03-16 15:19:25,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583936586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:25,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:25,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:25,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23881007] [2025-03-16 15:19:25,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:25,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:25,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:25,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:25,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:25,308 INFO L87 Difference]: Start difference. First operand 4408 states and 5159 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:26,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:26,528 INFO L93 Difference]: Finished difference Result 10935 states and 12969 transitions. [2025-03-16 15:19:26,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:26,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2025-03-16 15:19:26,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:26,541 INFO L225 Difference]: With dead ends: 10935 [2025-03-16 15:19:26,541 INFO L226 Difference]: Without dead ends: 6527 [2025-03-16 15:19:26,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:26,547 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 443 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:26,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 444 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:19:26,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6527 states. [2025-03-16 15:19:26,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6527 to 4381. [2025-03-16 15:19:26,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4381 states, 4380 states have (on average 1.1684931506849314) internal successors, (5118), 4380 states have internal predecessors, (5118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 5118 transitions. [2025-03-16 15:19:26,605 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 5118 transitions. Word has length 160 [2025-03-16 15:19:26,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:26,605 INFO L471 AbstractCegarLoop]: Abstraction has 4381 states and 5118 transitions. [2025-03-16 15:19:26,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 5118 transitions. [2025-03-16 15:19:26,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 15:19:26,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:26,607 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:26,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:19:26,607 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:26,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:26,608 INFO L85 PathProgramCache]: Analyzing trace with hash 161584945, now seen corresponding path program 1 times [2025-03-16 15:19:26,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:26,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517367032] [2025-03-16 15:19:26,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:26,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:26,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 15:19:26,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 15:19:26,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:26,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:26,821 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:19:26,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:26,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517367032] [2025-03-16 15:19:26,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517367032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:26,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:26,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:26,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139019498] [2025-03-16 15:19:26,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:26,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:26,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:26,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:26,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:26,825 INFO L87 Difference]: Start difference. First operand 4381 states and 5118 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:28,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:28,170 INFO L93 Difference]: Finished difference Result 10044 states and 11705 transitions. [2025-03-16 15:19:28,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:28,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2025-03-16 15:19:28,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:28,183 INFO L225 Difference]: With dead ends: 10044 [2025-03-16 15:19:28,183 INFO L226 Difference]: Without dead ends: 5664 [2025-03-16 15:19:28,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:28,203 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 429 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:28,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 892 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:19:28,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5664 states. [2025-03-16 15:19:28,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5664 to 5233. [2025-03-16 15:19:28,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5233 states, 5232 states have (on average 1.1588302752293578) internal successors, (6063), 5232 states have internal predecessors, (6063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5233 states to 5233 states and 6063 transitions. [2025-03-16 15:19:28,290 INFO L78 Accepts]: Start accepts. Automaton has 5233 states and 6063 transitions. Word has length 226 [2025-03-16 15:19:28,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:28,291 INFO L471 AbstractCegarLoop]: Abstraction has 5233 states and 6063 transitions. [2025-03-16 15:19:28,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:28,291 INFO L276 IsEmpty]: Start isEmpty. Operand 5233 states and 6063 transitions. [2025-03-16 15:19:28,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-16 15:19:28,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:28,293 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:28,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:19:28,293 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:28,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:28,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1378222090, now seen corresponding path program 1 times [2025-03-16 15:19:28,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:28,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620357113] [2025-03-16 15:19:28,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:28,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:28,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-16 15:19:28,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-16 15:19:28,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:28,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-16 15:19:28,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:28,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620357113] [2025-03-16 15:19:28,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620357113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:28,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:28,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:28,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925871801] [2025-03-16 15:19:28,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:28,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:28,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:28,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:28,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:28,446 INFO L87 Difference]: Start difference. First operand 5233 states and 6063 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:29,639 INFO L93 Difference]: Finished difference Result 12592 states and 14782 transitions. [2025-03-16 15:19:29,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:29,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2025-03-16 15:19:29,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:29,653 INFO L225 Difference]: With dead ends: 12592 [2025-03-16 15:19:29,654 INFO L226 Difference]: Without dead ends: 6935 [2025-03-16 15:19:29,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:29,658 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 383 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:29,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 845 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:19:29,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6935 states. [2025-03-16 15:19:29,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6935 to 6935. [2025-03-16 15:19:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6935 states, 6934 states have (on average 1.1322468993366022) internal successors, (7851), 6934 states have internal predecessors, (7851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 7851 transitions. [2025-03-16 15:19:29,718 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 7851 transitions. Word has length 238 [2025-03-16 15:19:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:29,718 INFO L471 AbstractCegarLoop]: Abstraction has 6935 states and 7851 transitions. [2025-03-16 15:19:29,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 7851 transitions. [2025-03-16 15:19:29,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-16 15:19:29,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:29,725 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:29,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:19:29,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:29,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:29,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1093962803, now seen corresponding path program 1 times [2025-03-16 15:19:29,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:29,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405356951] [2025-03-16 15:19:29,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:29,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:29,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-16 15:19:29,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-16 15:19:29,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:29,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:29,889 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-16 15:19:29,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:29,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405356951] [2025-03-16 15:19:29,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405356951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:29,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:29,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:29,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666241451] [2025-03-16 15:19:29,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:29,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:29,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:29,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:29,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:29,890 INFO L87 Difference]: Start difference. First operand 6935 states and 7851 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:31,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:31,238 INFO L93 Difference]: Finished difference Result 16423 states and 18737 transitions. [2025-03-16 15:19:31,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:31,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 278 [2025-03-16 15:19:31,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:31,254 INFO L225 Difference]: With dead ends: 16423 [2025-03-16 15:19:31,254 INFO L226 Difference]: Without dead ends: 9489 [2025-03-16 15:19:31,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:31,260 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 464 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:31,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 401 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:19:31,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9489 states. [2025-03-16 15:19:31,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9489 to 8635. [2025-03-16 15:19:31,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8635 states, 8634 states have (on average 1.1299513551077136) internal successors, (9756), 8634 states have internal predecessors, (9756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:31,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8635 states to 8635 states and 9756 transitions. [2025-03-16 15:19:31,438 INFO L78 Accepts]: Start accepts. Automaton has 8635 states and 9756 transitions. Word has length 278 [2025-03-16 15:19:31,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:31,439 INFO L471 AbstractCegarLoop]: Abstraction has 8635 states and 9756 transitions. [2025-03-16 15:19:31,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:31,439 INFO L276 IsEmpty]: Start isEmpty. Operand 8635 states and 9756 transitions. [2025-03-16 15:19:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-16 15:19:31,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:31,445 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:31,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:19:31,445 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:31,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:31,446 INFO L85 PathProgramCache]: Analyzing trace with hash 872218530, now seen corresponding path program 1 times [2025-03-16 15:19:31,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:31,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658613442] [2025-03-16 15:19:31,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:31,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:31,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-16 15:19:31,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-16 15:19:31,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:31,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:31,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:19:31,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:31,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658613442] [2025-03-16 15:19:31,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658613442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:31,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:31,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:31,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343196825] [2025-03-16 15:19:31,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:31,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:19:31,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:31,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:19:31,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:19:31,748 INFO L87 Difference]: Start difference. First operand 8635 states and 9756 transitions. Second operand has 4 states, 4 states have (on average 86.25) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:33,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:33,552 INFO L93 Difference]: Finished difference Result 22828 states and 25827 transitions. [2025-03-16 15:19:33,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:19:33,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 345 [2025-03-16 15:19:33,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:33,574 INFO L225 Difference]: With dead ends: 22828 [2025-03-16 15:19:33,575 INFO L226 Difference]: Without dead ends: 13769 [2025-03-16 15:19:33,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:19:33,587 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 668 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 2697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:33,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 194 Invalid, 2697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:19:33,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13769 states. [2025-03-16 15:19:33,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13769 to 13767. [2025-03-16 15:19:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13767 states, 13766 states have (on average 1.1357692866482638) internal successors, (15635), 13766 states have internal predecessors, (15635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13767 states to 13767 states and 15635 transitions. [2025-03-16 15:19:33,741 INFO L78 Accepts]: Start accepts. Automaton has 13767 states and 15635 transitions. Word has length 345 [2025-03-16 15:19:33,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:33,741 INFO L471 AbstractCegarLoop]: Abstraction has 13767 states and 15635 transitions. [2025-03-16 15:19:33,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 13767 states and 15635 transitions. [2025-03-16 15:19:33,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-03-16 15:19:33,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:33,748 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:33,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:19:33,748 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:33,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:33,749 INFO L85 PathProgramCache]: Analyzing trace with hash -815627519, now seen corresponding path program 1 times [2025-03-16 15:19:33,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:33,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508466086] [2025-03-16 15:19:33,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:33,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:33,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-16 15:19:33,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-16 15:19:33,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:33,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-16 15:19:33,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:33,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508466086] [2025-03-16 15:19:33,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508466086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:33,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:33,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:33,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565420605] [2025-03-16 15:19:33,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:33,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:33,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:33,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:33,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:33,901 INFO L87 Difference]: Start difference. First operand 13767 states and 15635 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:35,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:35,282 INFO L93 Difference]: Finished difference Result 38611 states and 43916 transitions. [2025-03-16 15:19:35,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:35,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 379 [2025-03-16 15:19:35,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:35,313 INFO L225 Difference]: With dead ends: 38611 [2025-03-16 15:19:35,313 INFO L226 Difference]: Without dead ends: 24845 [2025-03-16 15:19:35,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:35,327 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 496 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:35,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 286 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:19:35,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24845 states. [2025-03-16 15:19:35,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24845 to 23978. [2025-03-16 15:19:35,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23978 states, 23977 states have (on average 1.1273720648955248) internal successors, (27031), 23977 states have internal predecessors, (27031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23978 states to 23978 states and 27031 transitions. [2025-03-16 15:19:35,586 INFO L78 Accepts]: Start accepts. Automaton has 23978 states and 27031 transitions. Word has length 379 [2025-03-16 15:19:35,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:35,586 INFO L471 AbstractCegarLoop]: Abstraction has 23978 states and 27031 transitions. [2025-03-16 15:19:35,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:35,587 INFO L276 IsEmpty]: Start isEmpty. Operand 23978 states and 27031 transitions. [2025-03-16 15:19:35,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-03-16 15:19:35,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:35,593 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:35,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:19:35,593 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:35,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:35,594 INFO L85 PathProgramCache]: Analyzing trace with hash -738896011, now seen corresponding path program 1 times [2025-03-16 15:19:35,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:35,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811582271] [2025-03-16 15:19:35,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:35,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:35,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-16 15:19:35,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-16 15:19:35,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:35,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:19:35,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:35,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811582271] [2025-03-16 15:19:35,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811582271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:35,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:35,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:35,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020057088] [2025-03-16 15:19:35,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:35,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:35,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:35,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:35,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:35,893 INFO L87 Difference]: Start difference. First operand 23978 states and 27031 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:37,298 INFO L93 Difference]: Finished difference Result 53502 states and 60513 transitions. [2025-03-16 15:19:37,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:37,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 392 [2025-03-16 15:19:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:37,336 INFO L225 Difference]: With dead ends: 53502 [2025-03-16 15:19:37,336 INFO L226 Difference]: Without dead ends: 27820 [2025-03-16 15:19:37,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:37,356 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 465 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:37,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 840 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:19:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27820 states. [2025-03-16 15:19:37,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27820 to 27815. [2025-03-16 15:19:37,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27815 states, 27814 states have (on average 1.1233551448910621) internal successors, (31245), 27814 states have internal predecessors, (31245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27815 states to 27815 states and 31245 transitions. [2025-03-16 15:19:37,612 INFO L78 Accepts]: Start accepts. Automaton has 27815 states and 31245 transitions. Word has length 392 [2025-03-16 15:19:37,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:37,613 INFO L471 AbstractCegarLoop]: Abstraction has 27815 states and 31245 transitions. [2025-03-16 15:19:37,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand 27815 states and 31245 transitions. [2025-03-16 15:19:37,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-16 15:19:37,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:37,622 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:37,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:19:37,622 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:37,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:37,667 INFO L85 PathProgramCache]: Analyzing trace with hash 524132708, now seen corresponding path program 1 times [2025-03-16 15:19:37,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:37,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110006870] [2025-03-16 15:19:37,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:37,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:37,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-16 15:19:37,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-16 15:19:37,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:37,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:37,928 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-16 15:19:37,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:37,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110006870] [2025-03-16 15:19:37,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110006870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:37,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:37,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:37,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009004185] [2025-03-16 15:19:37,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:37,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:37,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:37,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:37,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:37,931 INFO L87 Difference]: Start difference. First operand 27815 states and 31245 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:39,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:39,289 INFO L93 Difference]: Finished difference Result 67163 states and 75522 transitions. [2025-03-16 15:19:39,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:39,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 441 [2025-03-16 15:19:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:39,328 INFO L225 Difference]: With dead ends: 67163 [2025-03-16 15:19:39,329 INFO L226 Difference]: Without dead ends: 39349 [2025-03-16 15:19:39,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:39,349 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 497 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:39,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 753 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:19:39,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39349 states. [2025-03-16 15:19:39,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39349 to 37623. [2025-03-16 15:19:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37623 states, 37622 states have (on average 1.1188400404018926) internal successors, (42093), 37622 states have internal predecessors, (42093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37623 states to 37623 states and 42093 transitions. [2025-03-16 15:19:39,939 INFO L78 Accepts]: Start accepts. Automaton has 37623 states and 42093 transitions. Word has length 441 [2025-03-16 15:19:39,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:39,939 INFO L471 AbstractCegarLoop]: Abstraction has 37623 states and 42093 transitions. [2025-03-16 15:19:39,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 37623 states and 42093 transitions. [2025-03-16 15:19:39,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-03-16 15:19:39,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:39,948 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:39,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:19:39,948 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:39,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:39,949 INFO L85 PathProgramCache]: Analyzing trace with hash -758535524, now seen corresponding path program 1 times [2025-03-16 15:19:39,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:39,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297302479] [2025-03-16 15:19:39,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:39,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:39,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-16 15:19:40,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-16 15:19:40,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:40,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:19:40,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:40,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297302479] [2025-03-16 15:19:40,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297302479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:40,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:40,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:19:40,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508353792] [2025-03-16 15:19:40,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:40,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:19:40,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:40,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:19:40,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:19:40,345 INFO L87 Difference]: Start difference. First operand 37623 states and 42093 transitions. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:42,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:42,564 INFO L93 Difference]: Finished difference Result 97400 states and 108372 transitions. [2025-03-16 15:19:42,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:19:42,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 449 [2025-03-16 15:19:42,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:42,684 INFO L225 Difference]: With dead ends: 97400 [2025-03-16 15:19:42,684 INFO L226 Difference]: Without dead ends: 59778 [2025-03-16 15:19:42,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:19:42,708 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 670 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 2370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:42,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 178 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:19:42,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59778 states. [2025-03-16 15:19:43,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59778 to 55940. [2025-03-16 15:19:43,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55940 states, 55939 states have (on average 1.1092082446951144) internal successors, (62048), 55939 states have internal predecessors, (62048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:43,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55940 states to 55940 states and 62048 transitions. [2025-03-16 15:19:43,359 INFO L78 Accepts]: Start accepts. Automaton has 55940 states and 62048 transitions. Word has length 449 [2025-03-16 15:19:43,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:43,359 INFO L471 AbstractCegarLoop]: Abstraction has 55940 states and 62048 transitions. [2025-03-16 15:19:43,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 55940 states and 62048 transitions. [2025-03-16 15:19:43,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-16 15:19:43,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:43,369 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:43,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:19:43,369 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:43,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:43,369 INFO L85 PathProgramCache]: Analyzing trace with hash 664457040, now seen corresponding path program 1 times [2025-03-16 15:19:43,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:43,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847287513] [2025-03-16 15:19:43,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:43,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:43,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-16 15:19:43,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-16 15:19:43,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:43,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:43,586 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-16 15:19:43,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:43,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847287513] [2025-03-16 15:19:43,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847287513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:43,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:43,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:43,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538629813] [2025-03-16 15:19:43,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:43,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:43,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:43,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:43,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:43,588 INFO L87 Difference]: Start difference. First operand 55940 states and 62048 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:44,848 INFO L93 Difference]: Finished difference Result 111868 states and 124084 transitions. [2025-03-16 15:19:44,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:44,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 473 [2025-03-16 15:19:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:44,901 INFO L225 Difference]: With dead ends: 111868 [2025-03-16 15:19:44,901 INFO L226 Difference]: Without dead ends: 55929 [2025-03-16 15:19:44,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:44,933 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 495 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:44,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 741 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:19:44,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55929 states. [2025-03-16 15:19:45,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55929 to 55077. [2025-03-16 15:19:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55077 states, 55076 states have (on average 1.0866439102331324) internal successors, (59848), 55076 states have internal predecessors, (59848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55077 states to 55077 states and 59848 transitions. [2025-03-16 15:19:45,543 INFO L78 Accepts]: Start accepts. Automaton has 55077 states and 59848 transitions. Word has length 473 [2025-03-16 15:19:45,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:45,544 INFO L471 AbstractCegarLoop]: Abstraction has 55077 states and 59848 transitions. [2025-03-16 15:19:45,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 55077 states and 59848 transitions. [2025-03-16 15:19:45,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-03-16 15:19:45,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:45,553 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:45,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:19:45,553 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:45,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:45,553 INFO L85 PathProgramCache]: Analyzing trace with hash 278479046, now seen corresponding path program 1 times [2025-03-16 15:19:45,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:45,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644594700] [2025-03-16 15:19:45,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:45,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:45,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-03-16 15:19:45,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-03-16 15:19:45,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:45,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:19:46,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:46,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644594700] [2025-03-16 15:19:46,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644594700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:46,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:46,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:46,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107604289] [2025-03-16 15:19:46,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:46,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:46,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:46,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:46,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:46,099 INFO L87 Difference]: Start difference. First operand 55077 states and 59848 transitions. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:47,488 INFO L93 Difference]: Finished difference Result 114002 states and 124010 transitions. [2025-03-16 15:19:47,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:47,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 492 [2025-03-16 15:19:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:47,548 INFO L225 Difference]: With dead ends: 114002 [2025-03-16 15:19:47,548 INFO L226 Difference]: Without dead ends: 58071 [2025-03-16 15:19:47,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:47,585 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 216 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:47,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 793 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:19:47,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58071 states. [2025-03-16 15:19:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58071 to 55078. [2025-03-16 15:19:48,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55078 states, 55077 states have (on average 1.0864970858979248) internal successors, (59841), 55077 states have internal predecessors, (59841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:48,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55078 states to 55078 states and 59841 transitions. [2025-03-16 15:19:48,194 INFO L78 Accepts]: Start accepts. Automaton has 55078 states and 59841 transitions. Word has length 492 [2025-03-16 15:19:48,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:48,195 INFO L471 AbstractCegarLoop]: Abstraction has 55078 states and 59841 transitions. [2025-03-16 15:19:48,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:48,195 INFO L276 IsEmpty]: Start isEmpty. Operand 55078 states and 59841 transitions. [2025-03-16 15:19:48,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-03-16 15:19:48,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:48,205 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:48,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:19:48,205 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:48,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:48,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1709688730, now seen corresponding path program 1 times [2025-03-16 15:19:48,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:48,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671882183] [2025-03-16 15:19:48,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:48,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:48,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-03-16 15:19:48,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-03-16 15:19:48,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:48,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 250 proven. 82 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 15:19:48,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:48,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671882183] [2025-03-16 15:19:48,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671882183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:19:48,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436584848] [2025-03-16 15:19:48,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:48,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:19:48,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:19:48,578 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:19:48,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:19:48,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-03-16 15:19:48,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-03-16 15:19:48,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:48,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:48,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:19:48,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:19:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 250 proven. 82 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 15:19:49,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:19:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 15:19:49,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436584848] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:19:49,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:19:49,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2025-03-16 15:19:49,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530113946] [2025-03-16 15:19:49,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:49,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:19:49,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:49,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:19:49,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:19:49,430 INFO L87 Difference]: Start difference. First operand 55078 states and 59841 transitions. Second operand has 4 states, 4 states have (on average 125.25) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:52,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:52,025 INFO L93 Difference]: Finished difference Result 133610 states and 145216 transitions. [2025-03-16 15:19:52,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:19:52,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 125.25) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 505 [2025-03-16 15:19:52,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:52,101 INFO L225 Difference]: With dead ends: 133610 [2025-03-16 15:19:52,101 INFO L226 Difference]: Without dead ends: 76824 [2025-03-16 15:19:52,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1011 GetRequests, 1005 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:19:52,131 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 741 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 3063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:52,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 143 Invalid, 3063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:19:52,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76824 states. [2025-03-16 15:19:52,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76824 to 69537. [2025-03-16 15:19:52,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69537 states, 69536 states have (on average 1.0866745283018868) internal successors, (75563), 69536 states have internal predecessors, (75563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:52,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69537 states to 69537 states and 75563 transitions. [2025-03-16 15:19:52,845 INFO L78 Accepts]: Start accepts. Automaton has 69537 states and 75563 transitions. Word has length 505 [2025-03-16 15:19:52,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:52,845 INFO L471 AbstractCegarLoop]: Abstraction has 69537 states and 75563 transitions. [2025-03-16 15:19:52,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.25) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:52,845 INFO L276 IsEmpty]: Start isEmpty. Operand 69537 states and 75563 transitions. [2025-03-16 15:19:52,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-16 15:19:52,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:52,855 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:52,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:19:53,055 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,SelfDestructingSolverStorable15 [2025-03-16 15:19:53,055 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:53,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1211138301, now seen corresponding path program 1 times [2025-03-16 15:19:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:53,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791920789] [2025-03-16 15:19:53,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:53,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:53,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-16 15:19:53,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-16 15:19:53,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:53,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:53,468 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 277 proven. 82 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 15:19:53,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:53,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791920789] [2025-03-16 15:19:53,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791920789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:19:53,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618081027] [2025-03-16 15:19:53,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:53,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:19:53,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:19:53,470 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:19:53,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:19:53,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-16 15:19:53,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-16 15:19:53,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:53,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:53,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:19:53,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:19:54,010 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 200 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:19:54,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:19:54,437 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:19:54,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618081027] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:19:54,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:19:54,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 7 [2025-03-16 15:19:54,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875243529] [2025-03-16 15:19:54,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:54,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:19:54,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:54,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:19:54,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:19:54,440 INFO L87 Difference]: Start difference. First operand 69537 states and 75563 transitions. Second operand has 5 states, 5 states have (on average 106.0) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:57,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:57,349 INFO L93 Difference]: Finished difference Result 179962 states and 195945 transitions. [2025-03-16 15:19:57,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:19:57,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 106.0) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 530 [2025-03-16 15:19:57,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:57,477 INFO L225 Difference]: With dead ends: 179962 [2025-03-16 15:19:57,477 INFO L226 Difference]: Without dead ends: 107869 [2025-03-16 15:19:57,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1061 GetRequests, 1055 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:19:57,526 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 981 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 3156 mSolverCounterSat, 750 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 3906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 750 IncrementalHoareTripleChecker+Valid, 3156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:57,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 200 Invalid, 3906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [750 Valid, 3156 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:19:57,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107869 states. [2025-03-16 15:19:58,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107869 to 82725. [2025-03-16 15:19:58,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82725 states, 82724 states have (on average 1.0794569895072772) internal successors, (89297), 82724 states have internal predecessors, (89297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:58,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82725 states to 82725 states and 89297 transitions. [2025-03-16 15:19:58,698 INFO L78 Accepts]: Start accepts. Automaton has 82725 states and 89297 transitions. Word has length 530 [2025-03-16 15:19:58,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:58,698 INFO L471 AbstractCegarLoop]: Abstraction has 82725 states and 89297 transitions. [2025-03-16 15:19:58,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.0) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand 82725 states and 89297 transitions. [2025-03-16 15:19:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-03-16 15:19:58,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:58,714 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:58,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:19:58,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 15:19:58,915 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:58,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:58,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2031457433, now seen corresponding path program 1 times [2025-03-16 15:19:58,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:58,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438356544] [2025-03-16 15:19:58,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:58,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:58,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-16 15:19:59,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-16 15:19:59,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:59,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-03-16 15:19:59,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:59,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438356544] [2025-03-16 15:19:59,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438356544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:59,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:59,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:59,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263502250] [2025-03-16 15:19:59,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:59,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:59,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:59,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:59,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:59,216 INFO L87 Difference]: Start difference. First operand 82725 states and 89297 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:00,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:00,684 INFO L93 Difference]: Finished difference Result 170559 states and 184074 transitions. [2025-03-16 15:20:00,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:00,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 592 [2025-03-16 15:20:00,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:00,776 INFO L225 Difference]: With dead ends: 170559 [2025-03-16 15:20:00,776 INFO L226 Difference]: Without dead ends: 86132 [2025-03-16 15:20:00,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:00,830 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 504 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:00,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 674 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:20:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86132 states. [2025-03-16 15:20:01,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86132 to 82294. [2025-03-16 15:20:01,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82294 states, 82293 states have (on average 1.0696049481729917) internal successors, (88021), 82293 states have internal predecessors, (88021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82294 states to 82294 states and 88021 transitions. [2025-03-16 15:20:01,775 INFO L78 Accepts]: Start accepts. Automaton has 82294 states and 88021 transitions. Word has length 592 [2025-03-16 15:20:01,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:01,775 INFO L471 AbstractCegarLoop]: Abstraction has 82294 states and 88021 transitions. [2025-03-16 15:20:01,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:01,776 INFO L276 IsEmpty]: Start isEmpty. Operand 82294 states and 88021 transitions. [2025-03-16 15:20:01,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2025-03-16 15:20:01,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:01,788 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:20:01,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:20:01,788 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:01,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:01,789 INFO L85 PathProgramCache]: Analyzing trace with hash 399481388, now seen corresponding path program 1 times [2025-03-16 15:20:01,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:01,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781728201] [2025-03-16 15:20:01,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:01,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:01,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 635 statements into 1 equivalence classes. [2025-03-16 15:20:01,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 635 of 635 statements. [2025-03-16 15:20:01,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:01,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:02,037 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-16 15:20:02,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:02,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781728201] [2025-03-16 15:20:02,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781728201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:02,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:02,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:20:02,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974252715] [2025-03-16 15:20:02,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:02,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:20:02,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:02,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:20:02,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:20:02,039 INFO L87 Difference]: Start difference. First operand 82294 states and 88021 transitions. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:04,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:04,016 INFO L93 Difference]: Finished difference Result 177784 states and 190006 transitions. [2025-03-16 15:20:04,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:20:04,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 635 [2025-03-16 15:20:04,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:04,113 INFO L225 Difference]: With dead ends: 177784 [2025-03-16 15:20:04,113 INFO L226 Difference]: Without dead ends: 95491 [2025-03-16 15:20:04,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:20:04,169 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 696 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2298 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 2601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 2298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:04,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 291 Invalid, 2601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 2298 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:20:04,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95491 states. [2025-03-16 15:20:04,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95491 to 88239. [2025-03-16 15:20:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88239 states, 88238 states have (on average 1.0637933770031052) internal successors, (93867), 88238 states have internal predecessors, (93867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88239 states to 88239 states and 93867 transitions. [2025-03-16 15:20:05,134 INFO L78 Accepts]: Start accepts. Automaton has 88239 states and 93867 transitions. Word has length 635 [2025-03-16 15:20:05,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:05,135 INFO L471 AbstractCegarLoop]: Abstraction has 88239 states and 93867 transitions. [2025-03-16 15:20:05,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:05,135 INFO L276 IsEmpty]: Start isEmpty. Operand 88239 states and 93867 transitions. [2025-03-16 15:20:05,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-03-16 15:20:05,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:05,148 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:20:05,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:20:05,148 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:05,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:05,149 INFO L85 PathProgramCache]: Analyzing trace with hash -881729296, now seen corresponding path program 1 times [2025-03-16 15:20:05,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:05,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081037062] [2025-03-16 15:20:05,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:05,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:05,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-03-16 15:20:05,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-03-16 15:20:05,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:05,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 396 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-03-16 15:20:05,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:05,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081037062] [2025-03-16 15:20:05,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081037062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:05,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:05,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:20:05,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953727759] [2025-03-16 15:20:05,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:05,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:20:05,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:05,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:20:05,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:20:05,696 INFO L87 Difference]: Start difference. First operand 88239 states and 93867 transitions. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:07,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:07,839 INFO L93 Difference]: Finished difference Result 182024 states and 193526 transitions. [2025-03-16 15:20:07,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:20:07,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 641 [2025-03-16 15:20:07,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:07,936 INFO L225 Difference]: With dead ends: 182024 [2025-03-16 15:20:07,936 INFO L226 Difference]: Without dead ends: 93786 [2025-03-16 15:20:07,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:20:07,981 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 692 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2794 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:07,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 765 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2794 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:20:08,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93786 states. [2025-03-16 15:20:08,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93786 to 88664. [2025-03-16 15:20:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88664 states, 88663 states have (on average 1.06372443973247) internal successors, (94313), 88663 states have internal predecessors, (94313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88664 states to 88664 states and 94313 transitions. [2025-03-16 15:20:08,972 INFO L78 Accepts]: Start accepts. Automaton has 88664 states and 94313 transitions. Word has length 641 [2025-03-16 15:20:08,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:08,972 INFO L471 AbstractCegarLoop]: Abstraction has 88664 states and 94313 transitions. [2025-03-16 15:20:08,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:08,973 INFO L276 IsEmpty]: Start isEmpty. Operand 88664 states and 94313 transitions. [2025-03-16 15:20:09,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2025-03-16 15:20:09,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:09,130 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:20:09,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:20:09,130 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:09,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:09,131 INFO L85 PathProgramCache]: Analyzing trace with hash 763527732, now seen corresponding path program 1 times [2025-03-16 15:20:09,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:09,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083250310] [2025-03-16 15:20:09,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:09,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:09,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes. [2025-03-16 15:20:09,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements. [2025-03-16 15:20:09,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:09,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-16 15:20:09,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:09,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083250310] [2025-03-16 15:20:09,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083250310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:09,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:09,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:09,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066419465] [2025-03-16 15:20:09,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:09,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:09,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:09,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:09,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:09,495 INFO L87 Difference]: Start difference. First operand 88664 states and 94313 transitions. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:10,826 INFO L93 Difference]: Finished difference Result 184118 states and 195676 transitions. [2025-03-16 15:20:10,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:10,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 647 [2025-03-16 15:20:10,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:10,926 INFO L225 Difference]: With dead ends: 184118 [2025-03-16 15:20:10,926 INFO L226 Difference]: Without dead ends: 94173 [2025-03-16 15:20:10,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:10,978 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 312 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:10,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 590 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:20:11,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94173 states. [2025-03-16 15:20:11,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94173 to 89912. [2025-03-16 15:20:11,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89912 states, 89911 states have (on average 1.0602151016004715) internal successors, (95325), 89911 states have internal predecessors, (95325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89912 states to 89912 states and 95325 transitions. [2025-03-16 15:20:11,806 INFO L78 Accepts]: Start accepts. Automaton has 89912 states and 95325 transitions. Word has length 647 [2025-03-16 15:20:11,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:11,807 INFO L471 AbstractCegarLoop]: Abstraction has 89912 states and 95325 transitions. [2025-03-16 15:20:11,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 89912 states and 95325 transitions. [2025-03-16 15:20:11,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-03-16 15:20:11,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:11,826 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:20:11,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:20:11,827 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:11,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1924513299, now seen corresponding path program 1 times [2025-03-16 15:20:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:11,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532879960] [2025-03-16 15:20:11,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:11,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:11,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-03-16 15:20:11,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-03-16 15:20:11,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:11,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 664 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 15:20:13,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:13,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532879960] [2025-03-16 15:20:13,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532879960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:13,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:13,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 15:20:13,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028012129] [2025-03-16 15:20:13,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:13,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 15:20:13,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:13,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 15:20:13,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:20:13,375 INFO L87 Difference]: Start difference. First operand 89912 states and 95325 transitions. Second operand has 7 states, 7 states have (on average 94.71428571428571) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:16,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:16,294 INFO L93 Difference]: Finished difference Result 171715 states and 182017 transitions. [2025-03-16 15:20:16,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 15:20:16,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 94.71428571428571) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 667 [2025-03-16 15:20:16,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:16,393 INFO L225 Difference]: With dead ends: 171715 [2025-03-16 15:20:16,394 INFO L226 Difference]: Without dead ends: 81802 [2025-03-16 15:20:16,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:20:16,456 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 1448 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 5420 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 5500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 5420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:16,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1448 Valid, 265 Invalid, 5500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 5420 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:20:16,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81802 states. [2025-03-16 15:20:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81802 to 81791. [2025-03-16 15:20:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81791 states, 81790 states have (on average 1.059285976280719) internal successors, (86639), 81790 states have internal predecessors, (86639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81791 states to 81791 states and 86639 transitions. [2025-03-16 15:20:17,483 INFO L78 Accepts]: Start accepts. Automaton has 81791 states and 86639 transitions. Word has length 667 [2025-03-16 15:20:17,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:17,483 INFO L471 AbstractCegarLoop]: Abstraction has 81791 states and 86639 transitions. [2025-03-16 15:20:17,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.71428571428571) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 81791 states and 86639 transitions. [2025-03-16 15:20:17,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-03-16 15:20:17,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:17,509 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:20:17,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:20:17,509 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:17,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:17,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1518965229, now seen corresponding path program 1 times [2025-03-16 15:20:17,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:17,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918562287] [2025-03-16 15:20:17,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:17,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:17,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-03-16 15:20:17,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-03-16 15:20:17,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:17,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2025-03-16 15:20:17,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:17,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918562287] [2025-03-16 15:20:17,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918562287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:17,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:17,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:17,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982168492] [2025-03-16 15:20:17,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:17,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:17,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:17,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:17,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:17,922 INFO L87 Difference]: Start difference. First operand 81791 states and 86639 transitions. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:19,187 INFO L93 Difference]: Finished difference Result 166984 states and 176861 transitions. [2025-03-16 15:20:19,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:19,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 734 [2025-03-16 15:20:19,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:19,275 INFO L225 Difference]: With dead ends: 166984 [2025-03-16 15:20:19,276 INFO L226 Difference]: Without dead ends: 85194 [2025-03-16 15:20:19,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:19,322 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 442 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:19,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 285 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:20:19,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85194 states. [2025-03-16 15:20:20,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85194 to 79662. [2025-03-16 15:20:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79662 states, 79661 states have (on average 1.0582342677094188) internal successors, (84300), 79661 states have internal predecessors, (84300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79662 states to 79662 states and 84300 transitions. [2025-03-16 15:20:20,176 INFO L78 Accepts]: Start accepts. Automaton has 79662 states and 84300 transitions. Word has length 734 [2025-03-16 15:20:20,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:20,176 INFO L471 AbstractCegarLoop]: Abstraction has 79662 states and 84300 transitions. [2025-03-16 15:20:20,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:20,176 INFO L276 IsEmpty]: Start isEmpty. Operand 79662 states and 84300 transitions. [2025-03-16 15:20:20,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2025-03-16 15:20:20,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:20,193 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:20:20,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 15:20:20,193 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:20,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:20,193 INFO L85 PathProgramCache]: Analyzing trace with hash 816659986, now seen corresponding path program 1 times [2025-03-16 15:20:20,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:20,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532009416] [2025-03-16 15:20:20,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:20,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:20,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 740 statements into 1 equivalence classes. [2025-03-16 15:20:20,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 740 of 740 statements. [2025-03-16 15:20:20,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:20,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 910 proven. 105 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:20:20,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:20,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532009416] [2025-03-16 15:20:20,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532009416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:20:20,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553490271] [2025-03-16 15:20:20,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:20,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:20:20,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:20:20,826 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:20:20,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:20:20,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 740 statements into 1 equivalence classes. [2025-03-16 15:20:21,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 740 of 740 statements. [2025-03-16 15:20:21,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:21,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:21,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:20:21,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:20:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 951 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-16 15:20:21,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:20:21,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553490271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:21,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:20:21,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-16 15:20:21,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738166260] [2025-03-16 15:20:21,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:21,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:20:21,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:21,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:20:21,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:20:21,489 INFO L87 Difference]: Start difference. First operand 79662 states and 84300 transitions. Second operand has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:24,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:24,053 INFO L93 Difference]: Finished difference Result 170843 states and 180587 transitions. [2025-03-16 15:20:24,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:20:24,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 740 [2025-03-16 15:20:24,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:24,155 INFO L225 Difference]: With dead ends: 170843 [2025-03-16 15:20:24,155 INFO L226 Difference]: Without dead ends: 90757 [2025-03-16 15:20:24,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 738 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:20:24,211 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1162 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4036 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 4256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 4036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:24,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 277 Invalid, 4256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 4036 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:20:24,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90757 states. [2025-03-16 15:20:24,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90757 to 84356. [2025-03-16 15:20:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84356 states, 84355 states have (on average 1.0525280066386107) internal successors, (88786), 84355 states have internal predecessors, (88786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84356 states to 84356 states and 88786 transitions. [2025-03-16 15:20:25,023 INFO L78 Accepts]: Start accepts. Automaton has 84356 states and 88786 transitions. Word has length 740 [2025-03-16 15:20:25,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:25,024 INFO L471 AbstractCegarLoop]: Abstraction has 84356 states and 88786 transitions. [2025-03-16 15:20:25,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 84356 states and 88786 transitions. [2025-03-16 15:20:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2025-03-16 15:20:25,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:25,041 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:20:25,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 15:20:25,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:20:25,241 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:25,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:25,242 INFO L85 PathProgramCache]: Analyzing trace with hash -183030178, now seen corresponding path program 1 times [2025-03-16 15:20:25,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:25,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035089022] [2025-03-16 15:20:25,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:25,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:25,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 740 statements into 1 equivalence classes. [2025-03-16 15:20:25,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 740 of 740 statements. [2025-03-16 15:20:25,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:25,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 912 trivial. 0 not checked. [2025-03-16 15:20:25,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:25,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035089022] [2025-03-16 15:20:25,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035089022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:25,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:25,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:25,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570989035] [2025-03-16 15:20:25,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:25,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:25,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:25,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:25,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:25,488 INFO L87 Difference]: Start difference. First operand 84356 states and 88786 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:26,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:26,645 INFO L93 Difference]: Finished difference Result 168710 states and 177575 transitions. [2025-03-16 15:20:26,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:26,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 740 [2025-03-16 15:20:26,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:26,726 INFO L225 Difference]: With dead ends: 168710 [2025-03-16 15:20:26,726 INFO L226 Difference]: Without dead ends: 84355 [2025-03-16 15:20:26,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:26,776 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 440 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:26,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 709 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:20:26,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84355 states. [2025-03-16 15:20:27,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84355 to 83501. [2025-03-16 15:20:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83501 states, 83500 states have (on average 1.052431137724551) internal successors, (87878), 83500 states have internal predecessors, (87878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83501 states to 83501 states and 87878 transitions. [2025-03-16 15:20:27,753 INFO L78 Accepts]: Start accepts. Automaton has 83501 states and 87878 transitions. Word has length 740 [2025-03-16 15:20:27,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:27,753 INFO L471 AbstractCegarLoop]: Abstraction has 83501 states and 87878 transitions. [2025-03-16 15:20:27,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:27,754 INFO L276 IsEmpty]: Start isEmpty. Operand 83501 states and 87878 transitions. [2025-03-16 15:20:27,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 802 [2025-03-16 15:20:27,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:27,776 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:20:27,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 15:20:27,776 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:27,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:27,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1115373353, now seen corresponding path program 1 times [2025-03-16 15:20:27,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:27,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702576255] [2025-03-16 15:20:27,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:27,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:27,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 801 statements into 1 equivalence classes. [2025-03-16 15:20:27,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 801 of 801 statements. [2025-03-16 15:20:27,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:27,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 797 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-03-16 15:20:28,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:28,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702576255] [2025-03-16 15:20:28,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702576255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:28,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:28,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:28,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945239785] [2025-03-16 15:20:28,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:28,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:28,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:28,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:28,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:28,121 INFO L87 Difference]: Start difference. First operand 83501 states and 87878 transitions. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:29,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:29,613 INFO L93 Difference]: Finished difference Result 177213 states and 186623 transitions. [2025-03-16 15:20:29,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:29,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 801 [2025-03-16 15:20:29,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:29,722 INFO L225 Difference]: With dead ends: 177213 [2025-03-16 15:20:29,722 INFO L226 Difference]: Without dead ends: 93286 [2025-03-16 15:20:29,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:29,781 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 372 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:29,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 618 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:20:29,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93286 states. [2025-03-16 15:20:30,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93286 to 90299. [2025-03-16 15:20:30,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90299 states, 90298 states have (on average 1.0514740082836829) internal successors, (94946), 90298 states have internal predecessors, (94946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90299 states to 90299 states and 94946 transitions. [2025-03-16 15:20:30,873 INFO L78 Accepts]: Start accepts. Automaton has 90299 states and 94946 transitions. Word has length 801 [2025-03-16 15:20:30,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:30,873 INFO L471 AbstractCegarLoop]: Abstraction has 90299 states and 94946 transitions. [2025-03-16 15:20:30,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:30,873 INFO L276 IsEmpty]: Start isEmpty. Operand 90299 states and 94946 transitions. [2025-03-16 15:20:30,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2025-03-16 15:20:30,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:30,897 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:20:30,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 15:20:30,898 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:30,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:30,898 INFO L85 PathProgramCache]: Analyzing trace with hash 663875846, now seen corresponding path program 1 times [2025-03-16 15:20:30,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:30,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820422229] [2025-03-16 15:20:30,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:30,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:31,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 813 statements into 1 equivalence classes. [2025-03-16 15:20:31,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 813 of 813 statements. [2025-03-16 15:20:31,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:31,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1453 backedges. 995 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2025-03-16 15:20:31,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:31,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820422229] [2025-03-16 15:20:31,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820422229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:31,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:31,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:31,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752829039] [2025-03-16 15:20:31,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:31,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:31,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:31,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:31,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:31,462 INFO L87 Difference]: Start difference. First operand 90299 states and 94946 transitions. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:32,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:32,689 INFO L93 Difference]: Finished difference Result 189546 states and 199287 transitions. [2025-03-16 15:20:32,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:32,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 813 [2025-03-16 15:20:32,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:32,795 INFO L225 Difference]: With dead ends: 189546 [2025-03-16 15:20:32,795 INFO L226 Difference]: Without dead ends: 99248 [2025-03-16 15:20:32,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:32,848 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 318 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:32,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 657 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:20:32,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99248 states. [2025-03-16 15:20:33,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99248 to 97952. [2025-03-16 15:20:33,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97952 states, 97951 states have (on average 1.0493103694704495) internal successors, (102781), 97951 states have internal predecessors, (102781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97952 states to 97952 states and 102781 transitions. [2025-03-16 15:20:33,886 INFO L78 Accepts]: Start accepts. Automaton has 97952 states and 102781 transitions. Word has length 813 [2025-03-16 15:20:33,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:33,887 INFO L471 AbstractCegarLoop]: Abstraction has 97952 states and 102781 transitions. [2025-03-16 15:20:33,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:33,887 INFO L276 IsEmpty]: Start isEmpty. Operand 97952 states and 102781 transitions. [2025-03-16 15:20:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 826 [2025-03-16 15:20:33,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:33,920 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:20:33,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 15:20:33,920 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:33,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:33,921 INFO L85 PathProgramCache]: Analyzing trace with hash 38094210, now seen corresponding path program 1 times [2025-03-16 15:20:33,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:33,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162926584] [2025-03-16 15:20:33,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:33,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms