./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_20-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_20-1.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 3ed743515f4bceb442ae4e323a2d4b2eccbeef1c0a0d2152663feb9a9e538afb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:42:55,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:42:55,691 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:42:55,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:42:55,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:42:55,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:42:55,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:42:55,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:42:55,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:42:55,723 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:42:55,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:42:55,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:42:55,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:42:55,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:42:55,724 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:42:55,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:42:55,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:42:55,724 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:42:55,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:42:55,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:42:55,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:42:55,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:42:55,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:42:55,724 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:42:55,724 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:42:55,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:42:55,724 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:42:55,724 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:42:55,724 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:42:55,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:42:55,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:42:55,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:42:55,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:42:55,725 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:42:55,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:42:55,725 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:42:55,725 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:42:55,725 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:42:55,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:42:55,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:42:55,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:42:55,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:42:55,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:42:55,725 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 -> 3ed743515f4bceb442ae4e323a2d4b2eccbeef1c0a0d2152663feb9a9e538afb [2025-03-08 05:42:55,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:42:55,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:42:55,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:42:55,947 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:42:55,948 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:42:55,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_20-1.c [2025-03-08 05:42:57,063 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/165ccac58/a9843c6e33fb4726a6a88461236927ca/FLAGb035d7c55 [2025-03-08 05:42:57,243 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:42:57,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_20-1.c [2025-03-08 05:42:57,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/165ccac58/a9843c6e33fb4726a6a88461236927ca/FLAGb035d7c55 [2025-03-08 05:42:57,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/165ccac58/a9843c6e33fb4726a6a88461236927ca [2025-03-08 05:42:57,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:42:57,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:42:57,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:42:57,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:42:57,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:42:57,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:42:57" (1/1) ... [2025-03-08 05:42:57,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab8a5d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:57, skipping insertion in model container [2025-03-08 05:42:57,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:42:57" (1/1) ... [2025-03-08 05:42:57,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:42:57,391 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/recursive-simple/fibo_20-1.c[745,758] [2025-03-08 05:42:57,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:42:57,401 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:42:57,409 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/recursive-simple/fibo_20-1.c[745,758] [2025-03-08 05:42:57,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:42:57,421 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:42:57,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:57 WrapperNode [2025-03-08 05:42:57,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:42:57,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:42:57,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:42:57,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:42:57,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:57" (1/1) ... [2025-03-08 05:42:57,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:57" (1/1) ... [2025-03-08 05:42:57,442 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2025-03-08 05:42:57,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:42:57,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:42:57,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:42:57,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:42:57,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:57" (1/1) ... [2025-03-08 05:42:57,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:57" (1/1) ... [2025-03-08 05:42:57,451 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:57" (1/1) ... [2025-03-08 05:42:57,461 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 05:42:57,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:57" (1/1) ... [2025-03-08 05:42:57,464 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:57" (1/1) ... [2025-03-08 05:42:57,466 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:57" (1/1) ... [2025-03-08 05:42:57,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:57" (1/1) ... [2025-03-08 05:42:57,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:57" (1/1) ... [2025-03-08 05:42:57,467 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:57" (1/1) ... [2025-03-08 05:42:57,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:42:57,471 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:42:57,472 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:42:57,472 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:42:57,473 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:57" (1/1) ... [2025-03-08 05:42:57,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:42:57,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:57,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:42:57,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:42:57,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:42:57,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:42:57,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:42:57,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:42:57,521 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2025-03-08 05:42:57,521 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2025-03-08 05:42:57,563 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:42:57,564 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:42:57,631 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13: havoc #t~ret4;havoc #t~ret5; [2025-03-08 05:42:57,638 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-08 05:42:57,638 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:42:57,644 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:42:57,644 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:42:57,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:57 BoogieIcfgContainer [2025-03-08 05:42:57,644 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:42:57,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:42:57,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:42:57,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:42:57,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:42:57" (1/3) ... [2025-03-08 05:42:57,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3384b696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:42:57, skipping insertion in model container [2025-03-08 05:42:57,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:57" (2/3) ... [2025-03-08 05:42:57,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3384b696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:42:57, skipping insertion in model container [2025-03-08 05:42:57,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:57" (3/3) ... [2025-03-08 05:42:57,653 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_20-1.c [2025-03-08 05:42:57,665 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:42:57,667 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_20-1.c that has 2 procedures, 20 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 05:42:57,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:42:57,715 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;@131de2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:42:57,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:42:57,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:42:57,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 05:42:57,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:57,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:57,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:57,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:57,729 INFO L85 PathProgramCache]: Analyzing trace with hash 402921910, now seen corresponding path program 1 times [2025-03-08 05:42:57,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:57,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229974723] [2025-03-08 05:42:57,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:57,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:57,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 05:42:57,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 05:42:57,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:57,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:57,955 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-08 05:42:57,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:57,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229974723] [2025-03-08 05:42:57,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229974723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:57,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:57,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:42:57,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194961928] [2025-03-08 05:42:57,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:57,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:42:57,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:57,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:42:57,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:42:57,978 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:42:58,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:58,017 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-03-08 05:42:58,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:42:58,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-03-08 05:42:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:58,024 INFO L225 Difference]: With dead ends: 30 [2025-03-08 05:42:58,025 INFO L226 Difference]: Without dead ends: 18 [2025-03-08 05:42:58,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:42:58,029 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:58,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:58,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-08 05:42:58,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-08 05:42:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 05:42:58,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-08 05:42:58,055 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2025-03-08 05:42:58,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:58,056 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-08 05:42:58,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:42:58,056 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-08 05:42:58,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 05:42:58,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:58,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:58,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:42:58,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:58,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:58,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2143228819, now seen corresponding path program 1 times [2025-03-08 05:42:58,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:58,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719330566] [2025-03-08 05:42:58,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:58,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:58,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 05:42:58,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 05:42:58,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:58,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:58,121 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-08 05:42:58,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:58,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719330566] [2025-03-08 05:42:58,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719330566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:58,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:58,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:42:58,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541675395] [2025-03-08 05:42:58,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:58,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:42:58,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:58,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:42:58,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:42:58,124 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:42:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:58,148 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-03-08 05:42:58,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:42:58,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-08 05:42:58,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:58,150 INFO L225 Difference]: With dead ends: 24 [2025-03-08 05:42:58,150 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 05:42:58,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:42:58,151 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:58,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:58,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 05:42:58,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-08 05:42:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 05:42:58,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-08 05:42:58,161 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2025-03-08 05:42:58,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:58,161 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-08 05:42:58,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:42:58,161 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-08 05:42:58,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 05:42:58,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:58,163 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:58,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:42:58,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:58,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:58,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1857137997, now seen corresponding path program 1 times [2025-03-08 05:42:58,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:58,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990034068] [2025-03-08 05:42:58,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:58,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:58,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:42:58,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:42:58,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:58,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:42:58,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:58,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990034068] [2025-03-08 05:42:58,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990034068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:58,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097048782] [2025-03-08 05:42:58,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:58,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:58,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:58,273 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:58,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:42:58,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:42:58,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:42:58,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:58,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:58,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:42:58,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:42:58,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:42:58,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097048782] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:58,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:58,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2025-03-08 05:42:58,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495670988] [2025-03-08 05:42:58,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:58,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:42:58,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:58,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:42:58,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:42:58,615 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 05:42:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:58,692 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2025-03-08 05:42:58,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:42:58,692 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2025-03-08 05:42:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:58,693 INFO L225 Difference]: With dead ends: 35 [2025-03-08 05:42:58,693 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 05:42:58,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:42:58,694 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:58,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 48 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 05:42:58,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-08 05:42:58,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:42:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-03-08 05:42:58,699 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2025-03-08 05:42:58,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:58,699 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-03-08 05:42:58,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 05:42:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-03-08 05:42:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 05:42:58,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:58,701 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:58,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:42:58,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:58,904 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:58,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:58,905 INFO L85 PathProgramCache]: Analyzing trace with hash -318077138, now seen corresponding path program 1 times [2025-03-08 05:42:58,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:58,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127672400] [2025-03-08 05:42:58,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:58,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:58,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 05:42:58,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 05:42:58,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:58,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:58,997 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:42:58,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:58,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127672400] [2025-03-08 05:42:58,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127672400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:58,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342926778] [2025-03-08 05:42:58,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:58,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:58,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:58,999 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-08 05:42:59,001 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-08 05:42:59,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 05:42:59,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 05:42:59,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:59,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:59,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:42:59,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:42:59,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:42:59,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342926778] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:59,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:59,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2025-03-08 05:42:59,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99742927] [2025-03-08 05:42:59,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:59,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:42:59,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:59,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:42:59,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:42:59,191 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:42:59,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:59,244 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2025-03-08 05:42:59,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:42:59,245 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2025-03-08 05:42:59,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:59,246 INFO L225 Difference]: With dead ends: 29 [2025-03-08 05:42:59,246 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 05:42:59,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:42:59,246 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:59,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:59,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 05:42:59,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-08 05:42:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:42:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-03-08 05:42:59,251 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 24 [2025-03-08 05:42:59,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:59,252 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-08 05:42:59,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:42:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-03-08 05:42:59,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 05:42:59,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:59,253 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:59,260 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-08 05:42:59,453 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,SelfDestructingSolverStorable3 [2025-03-08 05:42:59,453 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:59,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:59,454 INFO L85 PathProgramCache]: Analyzing trace with hash -896080901, now seen corresponding path program 2 times [2025-03-08 05:42:59,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:59,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271749018] [2025-03-08 05:42:59,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:59,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:59,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 05:42:59,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 05:42:59,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:59,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:42:59,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:59,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271749018] [2025-03-08 05:42:59,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271749018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:59,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548071726] [2025-03-08 05:42:59,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:59,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:59,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:59,712 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-08 05:42:59,715 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-08 05:42:59,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 05:42:59,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 05:42:59,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:59,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:59,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:42:59,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:59,835 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 05:42:59,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 05:43:00,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548071726] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:00,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:00,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 20 [2025-03-08 05:43:00,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941263446] [2025-03-08 05:43:00,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:00,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:43:00,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:00,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:43:00,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:43:00,130 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-08 05:43:00,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:00,355 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2025-03-08 05:43:00,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:43:00,356 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2025-03-08 05:43:00,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:00,357 INFO L225 Difference]: With dead ends: 46 [2025-03-08 05:43:00,357 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 05:43:00,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2025-03-08 05:43:00,358 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:00,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:00,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 05:43:00,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2025-03-08 05:43:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (20), 7 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-08 05:43:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. [2025-03-08 05:43:00,369 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 46 transitions. Word has length 37 [2025-03-08 05:43:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:00,369 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 46 transitions. [2025-03-08 05:43:00,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-08 05:43:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 46 transitions. [2025-03-08 05:43:00,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 05:43:00,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:00,371 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 9, 6, 6, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:00,377 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-08 05:43:00,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:00,575 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:00,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:00,575 INFO L85 PathProgramCache]: Analyzing trace with hash 525573421, now seen corresponding path program 3 times [2025-03-08 05:43:00,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:00,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766868014] [2025-03-08 05:43:00,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:43:00,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:00,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 12 equivalence classes. [2025-03-08 05:43:00,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 54 of 91 statements. [2025-03-08 05:43:00,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 05:43:00,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 167 proven. 29 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-08 05:43:00,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:00,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766868014] [2025-03-08 05:43:00,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766868014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:00,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850850039] [2025-03-08 05:43:00,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:43:00,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:00,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:00,714 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:00,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:43:00,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 12 equivalence classes. [2025-03-08 05:43:00,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 54 of 91 statements. [2025-03-08 05:43:00,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 05:43:00,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:00,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:43:00,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 215 proven. 12 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-08 05:43:00,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 169 proven. 27 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-08 05:43:01,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850850039] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:01,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:01,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 13 [2025-03-08 05:43:01,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778970245] [2025-03-08 05:43:01,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:01,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 05:43:01,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:01,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 05:43:01,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:43:01,170 INFO L87 Difference]: Start difference. First operand 30 states and 46 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-08 05:43:01,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:01,269 INFO L93 Difference]: Finished difference Result 62 states and 110 transitions. [2025-03-08 05:43:01,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:43:01,270 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) Word has length 91 [2025-03-08 05:43:01,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:01,270 INFO L225 Difference]: With dead ends: 62 [2025-03-08 05:43:01,271 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 05:43:01,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 174 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:43:01,272 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:01,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 68 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:01,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 05:43:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2025-03-08 05:43:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 05:43:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2025-03-08 05:43:01,281 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 91 [2025-03-08 05:43:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:01,282 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2025-03-08 05:43:01,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-08 05:43:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2025-03-08 05:43:01,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:43:01,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:01,284 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:01,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:43:01,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:01,484 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:01,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:01,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1467785241, now seen corresponding path program 4 times [2025-03-08 05:43:01,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:01,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715146193] [2025-03-08 05:43:01,485 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:43:01,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:01,495 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-08 05:43:01,500 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 77 of 93 statements. [2025-03-08 05:43:01,500 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:43:01,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 91 proven. 165 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-08 05:43:01,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:01,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715146193] [2025-03-08 05:43:01,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715146193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:01,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946777825] [2025-03-08 05:43:01,641 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:43:01,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:01,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:01,643 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:01,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:43:01,675 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-08 05:43:01,692 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 77 of 93 statements. [2025-03-08 05:43:01,692 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:43:01,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:01,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 05:43:01,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:01,765 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 106 proven. 170 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-08 05:43:01,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 106 proven. 182 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-03-08 05:43:02,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946777825] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:02,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:02,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 20 [2025-03-08 05:43:02,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475922919] [2025-03-08 05:43:02,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:02,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:43:02,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:02,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:43:02,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:43:02,396 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 14 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (21), 9 states have call predecessors, (21), 14 states have call successors, (21) [2025-03-08 05:43:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:02,626 INFO L93 Difference]: Finished difference Result 75 states and 123 transitions. [2025-03-08 05:43:02,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:43:02,627 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 14 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (21), 9 states have call predecessors, (21), 14 states have call successors, (21) Word has length 93 [2025-03-08 05:43:02,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:02,627 INFO L225 Difference]: With dead ends: 75 [2025-03-08 05:43:02,628 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 05:43:02,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 174 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2025-03-08 05:43:02,629 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 83 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:02,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 100 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:02,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 05:43:02,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2025-03-08 05:43:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-08 05:43:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2025-03-08 05:43:02,634 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 93 [2025-03-08 05:43:02,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:02,634 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2025-03-08 05:43:02,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 14 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (21), 9 states have call predecessors, (21), 14 states have call successors, (21) [2025-03-08 05:43:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2025-03-08 05:43:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 05:43:02,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:02,635 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:02,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 05:43:02,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:02,836 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:02,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:02,836 INFO L85 PathProgramCache]: Analyzing trace with hash 152396661, now seen corresponding path program 5 times [2025-03-08 05:43:02,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:02,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989121026] [2025-03-08 05:43:02,837 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:43:02,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:02,841 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 65 statements into 8 equivalence classes. [2025-03-08 05:43:02,862 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 05:43:02,862 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-08 05:43:02,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 39 proven. 57 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-08 05:43:02,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:02,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989121026] [2025-03-08 05:43:02,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989121026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:02,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178204250] [2025-03-08 05:43:02,934 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:43:02,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:02,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:02,936 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:02,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:43:02,965 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 65 statements into 8 equivalence classes. [2025-03-08 05:43:02,980 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 05:43:02,980 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-08 05:43:02,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:02,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:43:02,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 36 proven. 55 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-08 05:43:03,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 36 proven. 62 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 05:43:03,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178204250] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:03,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:03,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 12 [2025-03-08 05:43:03,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740181529] [2025-03-08 05:43:03,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:03,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:43:03,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:03,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:43:03,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:43:03,258 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 12 states, 10 states have (on average 3.9) internal successors, (39), 12 states have internal predecessors, (39), 8 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2025-03-08 05:43:03,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:03,334 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2025-03-08 05:43:03,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:43:03,334 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 12 states have internal predecessors, (39), 8 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) Word has length 65 [2025-03-08 05:43:03,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:03,335 INFO L225 Difference]: With dead ends: 51 [2025-03-08 05:43:03,335 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 05:43:03,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:43:03,336 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:03,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 69 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 05:43:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-08 05:43:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-08 05:43:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2025-03-08 05:43:03,342 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 65 [2025-03-08 05:43:03,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:03,342 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2025-03-08 05:43:03,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 12 states have internal predecessors, (39), 8 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2025-03-08 05:43:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2025-03-08 05:43:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 05:43:03,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:03,343 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:03,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 05:43:03,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:03,547 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:03,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:03,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1346149011, now seen corresponding path program 6 times [2025-03-08 05:43:03,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:03,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820568495] [2025-03-08 05:43:03,548 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:43:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:03,553 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 147 statements into 21 equivalence classes. [2025-03-08 05:43:03,576 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) and asserted 108 of 147 statements. [2025-03-08 05:43:03,576 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2025-03-08 05:43:03,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 111 proven. 250 refuted. 0 times theorem prover too weak. 795 trivial. 0 not checked. [2025-03-08 05:43:03,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:03,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820568495] [2025-03-08 05:43:03,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820568495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:03,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115510939] [2025-03-08 05:43:03,671 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:43:03,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:03,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:03,673 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:03,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 05:43:03,711 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 147 statements into 21 equivalence classes. [2025-03-08 05:43:03,739 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) and asserted 108 of 147 statements. [2025-03-08 05:43:03,739 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2025-03-08 05:43:03,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:03,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:43:03,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:03,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 111 proven. 250 refuted. 0 times theorem prover too weak. 795 trivial. 0 not checked. [2025-03-08 05:43:03,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 113 proven. 263 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-08 05:43:04,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115510939] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:04,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:04,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2025-03-08 05:43:04,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119166697] [2025-03-08 05:43:04,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:04,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 05:43:04,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:04,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 05:43:04,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:43:04,307 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 13 states, 11 states have (on average 3.727272727272727) internal successors, (41), 13 states have internal predecessors, (41), 9 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) [2025-03-08 05:43:04,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:04,368 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2025-03-08 05:43:04,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:43:04,369 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.727272727272727) internal successors, (41), 13 states have internal predecessors, (41), 9 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) Word has length 147 [2025-03-08 05:43:04,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:04,371 INFO L225 Difference]: With dead ends: 58 [2025-03-08 05:43:04,371 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 05:43:04,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 288 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:43:04,372 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:04,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 75 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:43:04,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 05:43:04,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2025-03-08 05:43:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (24), 11 states have call predecessors, (24), 8 states have call successors, (24) [2025-03-08 05:43:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2025-03-08 05:43:04,382 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 147 [2025-03-08 05:43:04,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:04,382 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2025-03-08 05:43:04,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.727272727272727) internal successors, (41), 13 states have internal predecessors, (41), 9 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) [2025-03-08 05:43:04,383 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2025-03-08 05:43:04,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-08 05:43:04,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:04,387 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 37, 22, 22, 22, 22, 22, 22, 22, 15, 8, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:04,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 05:43:04,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:04,588 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:04,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:04,588 INFO L85 PathProgramCache]: Analyzing trace with hash 636404269, now seen corresponding path program 7 times [2025-03-08 05:43:04,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:04,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692444997] [2025-03-08 05:43:04,588 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 05:43:04,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:04,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 05:43:04,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 05:43:04,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:43:04,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:05,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 534 proven. 907 refuted. 0 times theorem prover too weak. 4109 trivial. 0 not checked. [2025-03-08 05:43:05,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:05,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692444997] [2025-03-08 05:43:05,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692444997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:05,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088755699] [2025-03-08 05:43:05,012 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 05:43:05,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:05,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:05,014 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:05,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 05:43:05,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 05:43:05,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 05:43:05,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:43:05,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:05,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 05:43:05,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:05,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 164 proven. 1124 refuted. 0 times theorem prover too weak. 4262 trivial. 0 not checked. [2025-03-08 05:43:05,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 164 proven. 1164 refuted. 0 times theorem prover too weak. 4222 trivial. 0 not checked. [2025-03-08 05:43:06,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088755699] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:06,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:06,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 15] total 26 [2025-03-08 05:43:06,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900299456] [2025-03-08 05:43:06,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:06,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 05:43:06,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:06,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 05:43:06,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-03-08 05:43:06,496 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 26 states, 24 states have (on average 3.125) internal successors, (75), 26 states have internal predecessors, (75), 20 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (32), 14 states have call predecessors, (32), 20 states have call successors, (32) [2025-03-08 05:43:06,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:06,834 INFO L93 Difference]: Finished difference Result 130 states and 243 transitions. [2025-03-08 05:43:06,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 05:43:06,834 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.125) internal successors, (75), 26 states have internal predecessors, (75), 20 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (32), 14 states have call predecessors, (32), 20 states have call successors, (32) Word has length 311 [2025-03-08 05:43:06,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:06,836 INFO L225 Difference]: With dead ends: 130 [2025-03-08 05:43:06,836 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 05:43:06,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 607 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=432, Invalid=1374, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 05:43:06,837 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 160 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:06,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 176 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:43:06,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 05:43:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2025-03-08 05:43:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 53 states have internal predecessors, (55), 14 states have call successors, (14), 10 states have call predecessors, (14), 8 states have return successors, (33), 13 states have call predecessors, (33), 14 states have call successors, (33) [2025-03-08 05:43:06,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2025-03-08 05:43:06,846 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 311 [2025-03-08 05:43:06,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:06,846 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2025-03-08 05:43:06,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.125) internal successors, (75), 26 states have internal predecessors, (75), 20 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (32), 14 states have call predecessors, (32), 20 states have call successors, (32) [2025-03-08 05:43:06,847 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2025-03-08 05:43:06,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-08 05:43:06,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:06,848 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:06,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 05:43:07,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 05:43:07,049 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:07,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:07,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1946424999, now seen corresponding path program 8 times [2025-03-08 05:43:07,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:07,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378172874] [2025-03-08 05:43:07,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:43:07,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:07,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 283 statements into 2 equivalence classes. [2025-03-08 05:43:07,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 283 of 283 statements. [2025-03-08 05:43:07,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:43:07,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2025-03-08 05:43:07,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:07,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378172874] [2025-03-08 05:43:07,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378172874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:07,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115242590] [2025-03-08 05:43:07,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:43:07,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:07,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:07,324 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:07,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 05:43:07,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 283 statements into 2 equivalence classes. [2025-03-08 05:43:07,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 283 of 283 statements. [2025-03-08 05:43:07,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:43:07,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:07,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 05:43:07,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:07,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2025-03-08 05:43:07,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1187 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2025-03-08 05:43:08,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115242590] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:08,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:08,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2025-03-08 05:43:08,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282818808] [2025-03-08 05:43:08,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:08,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 05:43:08,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:08,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 05:43:08,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:43:08,964 INFO L87 Difference]: Start difference. First operand 77 states and 102 transitions. Second operand has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-08 05:43:09,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:09,114 INFO L93 Difference]: Finished difference Result 86 states and 120 transitions. [2025-03-08 05:43:09,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:43:09,115 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) Word has length 283 [2025-03-08 05:43:09,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:09,118 INFO L225 Difference]: With dead ends: 86 [2025-03-08 05:43:09,118 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 05:43:09,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 557 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:43:09,119 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 108 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:09,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 99 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:09,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 05:43:09,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-08 05:43:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 56 states have internal predecessors, (58), 15 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (42), 15 states have call predecessors, (42), 15 states have call successors, (42) [2025-03-08 05:43:09,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 115 transitions. [2025-03-08 05:43:09,133 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 115 transitions. Word has length 283 [2025-03-08 05:43:09,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:09,133 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 115 transitions. [2025-03-08 05:43:09,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-08 05:43:09,134 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 115 transitions. [2025-03-08 05:43:09,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-03-08 05:43:09,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:09,140 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 70, 43, 43, 43, 43, 43, 43, 43, 27, 17, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:09,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 05:43:09,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:09,341 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:09,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:09,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1691816878, now seen corresponding path program 9 times [2025-03-08 05:43:09,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:09,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116860660] [2025-03-08 05:43:09,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:43:09,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:09,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 596 statements into 78 equivalence classes. [2025-03-08 05:43:09,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) and asserted 273 of 596 statements. [2025-03-08 05:43:09,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2025-03-08 05:43:09,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 2834 proven. 256 refuted. 0 times theorem prover too weak. 17901 trivial. 0 not checked. [2025-03-08 05:43:09,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:09,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116860660] [2025-03-08 05:43:09,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116860660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:09,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348367115] [2025-03-08 05:43:09,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:43:09,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:09,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:09,662 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:09,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 05:43:09,753 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 596 statements into 78 equivalence classes. [2025-03-08 05:43:09,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) and asserted 273 of 596 statements. [2025-03-08 05:43:09,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2025-03-08 05:43:09,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:09,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 05:43:09,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 3146 proven. 296 refuted. 0 times theorem prover too weak. 17549 trivial. 0 not checked. [2025-03-08 05:43:09,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 3148 proven. 315 refuted. 0 times theorem prover too weak. 17528 trivial. 0 not checked. [2025-03-08 05:43:11,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348367115] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:11,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:11,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 17] total 24 [2025-03-08 05:43:11,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879087778] [2025-03-08 05:43:11,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:11,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 05:43:11,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:11,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 05:43:11,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2025-03-08 05:43:11,534 INFO L87 Difference]: Start difference. First operand 82 states and 115 transitions. Second operand has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 12 states have call successors, (20), 1 states have call predecessors, (20), 10 states have return successors, (26), 14 states have call predecessors, (26), 12 states have call successors, (26) [2025-03-08 05:43:11,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:11,727 INFO L93 Difference]: Finished difference Result 177 states and 268 transitions. [2025-03-08 05:43:11,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 05:43:11,727 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 12 states have call successors, (20), 1 states have call predecessors, (20), 10 states have return successors, (26), 14 states have call predecessors, (26), 12 states have call successors, (26) Word has length 596 [2025-03-08 05:43:11,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:11,730 INFO L225 Difference]: With dead ends: 177 [2025-03-08 05:43:11,730 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 05:43:11,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1219 GetRequests, 1177 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=342, Invalid=918, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 05:43:11,733 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 60 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:11,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 131 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:11,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 05:43:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2025-03-08 05:43:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 59 states have internal predecessors, (61), 16 states have call successors, (16), 11 states have call predecessors, (16), 9 states have return successors, (41), 15 states have call predecessors, (41), 16 states have call successors, (41) [2025-03-08 05:43:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2025-03-08 05:43:11,745 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 596 [2025-03-08 05:43:11,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:11,746 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2025-03-08 05:43:11,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 12 states have call successors, (20), 1 states have call predecessors, (20), 10 states have return successors, (26), 14 states have call predecessors, (26), 12 states have call successors, (26) [2025-03-08 05:43:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2025-03-08 05:43:11,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-03-08 05:43:11,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:11,751 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:11,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 05:43:11,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 05:43:11,953 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:11,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:11,953 INFO L85 PathProgramCache]: Analyzing trace with hash 281639384, now seen corresponding path program 10 times [2025-03-08 05:43:11,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:11,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156095694] [2025-03-08 05:43:11,953 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:43:11,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:11,963 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 528 statements into 2 equivalence classes. [2025-03-08 05:43:11,985 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 448 of 528 statements. [2025-03-08 05:43:11,985 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:43:11,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:12,433 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1087 proven. 3186 refuted. 0 times theorem prover too weak. 12134 trivial. 0 not checked. [2025-03-08 05:43:12,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:12,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156095694] [2025-03-08 05:43:12,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156095694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:12,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700771362] [2025-03-08 05:43:12,434 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:43:12,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:12,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:12,436 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:12,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 05:43:12,527 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 528 statements into 2 equivalence classes. [2025-03-08 05:43:12,596 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 448 of 528 statements. [2025-03-08 05:43:12,596 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:43:12,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:12,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 05:43:12,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 8332 proven. 1855 refuted. 0 times theorem prover too weak. 6220 trivial. 0 not checked. [2025-03-08 05:43:12,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:15,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1254 proven. 3660 refuted. 0 times theorem prover too weak. 11493 trivial. 0 not checked. [2025-03-08 05:43:15,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700771362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:15,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:15,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 27] total 32 [2025-03-08 05:43:15,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307564810] [2025-03-08 05:43:15,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:15,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 05:43:15,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:15,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 05:43:15,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2025-03-08 05:43:15,490 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 32 states, 32 states have (on average 3.21875) internal successors, (103), 32 states have internal predecessors, (103), 26 states have call successors, (32), 2 states have call predecessors, (32), 14 states have return successors, (43), 15 states have call predecessors, (43), 26 states have call successors, (43) [2025-03-08 05:43:15,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:15,875 INFO L93 Difference]: Finished difference Result 187 states and 295 transitions. [2025-03-08 05:43:15,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 05:43:15,876 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.21875) internal successors, (103), 32 states have internal predecessors, (103), 26 states have call successors, (32), 2 states have call predecessors, (32), 14 states have return successors, (43), 15 states have call predecessors, (43), 26 states have call successors, (43) Word has length 528 [2025-03-08 05:43:15,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:15,877 INFO L225 Difference]: With dead ends: 187 [2025-03-08 05:43:15,877 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 05:43:15,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1105 GetRequests, 1036 SyntacticMatches, 13 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=824, Invalid=2482, Unknown=0, NotChecked=0, Total=3306 [2025-03-08 05:43:15,879 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 176 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:15,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 189 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:43:15,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 05:43:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2025-03-08 05:43:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 73 states have internal predecessors, (77), 20 states have call successors, (20), 16 states have call predecessors, (20), 9 states have return successors, (45), 15 states have call predecessors, (45), 20 states have call successors, (45) [2025-03-08 05:43:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 142 transitions. [2025-03-08 05:43:15,887 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 142 transitions. Word has length 528 [2025-03-08 05:43:15,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:15,887 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 142 transitions. [2025-03-08 05:43:15,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.21875) internal successors, (103), 32 states have internal predecessors, (103), 26 states have call successors, (32), 2 states have call predecessors, (32), 14 states have return successors, (43), 15 states have call predecessors, (43), 26 states have call successors, (43) [2025-03-08 05:43:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 142 transitions. [2025-03-08 05:43:15,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-08 05:43:15,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:15,890 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:15,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 05:43:16,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 05:43:16,091 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:16,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:16,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2121070825, now seen corresponding path program 11 times [2025-03-08 05:43:16,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:16,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119533174] [2025-03-08 05:43:16,091 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:43:16,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:16,109 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 569 statements into 78 equivalence classes. [2025-03-08 05:43:16,205 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 74 check-sat command(s) and asserted 529 of 569 statements. [2025-03-08 05:43:16,205 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 74 check-sat command(s) [2025-03-08 05:43:16,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:16,772 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 2669 proven. 2765 refuted. 0 times theorem prover too weak. 13669 trivial. 0 not checked. [2025-03-08 05:43:16,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:16,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119533174] [2025-03-08 05:43:16,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119533174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:16,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844588969] [2025-03-08 05:43:16,773 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:43:16,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:16,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:16,775 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:16,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 05:43:16,893 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 569 statements into 78 equivalence classes. [2025-03-08 05:43:17,045 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 74 check-sat command(s) and asserted 529 of 569 statements. [2025-03-08 05:43:17,045 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 74 check-sat command(s) [2025-03-08 05:43:17,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:17,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 05:43:17,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:17,141 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 2649 proven. 2769 refuted. 0 times theorem prover too weak. 13685 trivial. 0 not checked. [2025-03-08 05:43:17,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 2657 proven. 2852 refuted. 0 times theorem prover too weak. 13594 trivial. 0 not checked. [2025-03-08 05:43:20,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844588969] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:20,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:20,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 29] total 33 [2025-03-08 05:43:20,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076801225] [2025-03-08 05:43:20,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:20,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 05:43:20,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:20,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 05:43:20,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 05:43:20,009 INFO L87 Difference]: Start difference. First operand 105 states and 142 transitions. Second operand has 33 states, 33 states have (on average 3.121212121212121) internal successors, (103), 33 states have internal predecessors, (103), 27 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (41), 17 states have call predecessors, (41), 27 states have call successors, (41) [2025-03-08 05:43:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:20,527 INFO L93 Difference]: Finished difference Result 258 states and 402 transitions. [2025-03-08 05:43:20,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-08 05:43:20,527 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.121212121212121) internal successors, (103), 33 states have internal predecessors, (103), 27 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (41), 17 states have call predecessors, (41), 27 states have call successors, (41) Word has length 569 [2025-03-08 05:43:20,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:20,530 INFO L225 Difference]: With dead ends: 258 [2025-03-08 05:43:20,530 INFO L226 Difference]: Without dead ends: 151 [2025-03-08 05:43:20,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1204 GetRequests, 1121 SyntacticMatches, 14 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1210, Invalid=3760, Unknown=0, NotChecked=0, Total=4970 [2025-03-08 05:43:20,532 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 239 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:20,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 192 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:43:20,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-08 05:43:20,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 119. [2025-03-08 05:43:20,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 83 states have internal predecessors, (87), 24 states have call successors, (24), 19 states have call predecessors, (24), 9 states have return successors, (60), 16 states have call predecessors, (60), 24 states have call successors, (60) [2025-03-08 05:43:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2025-03-08 05:43:20,543 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 569 [2025-03-08 05:43:20,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:20,544 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2025-03-08 05:43:20,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.121212121212121) internal successors, (103), 33 states have internal predecessors, (103), 27 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (41), 17 states have call predecessors, (41), 27 states have call successors, (41) [2025-03-08 05:43:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2025-03-08 05:43:20,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 05:43:20,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:20,545 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:20,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 05:43:20,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 05:43:20,746 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:20,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:20,746 INFO L85 PathProgramCache]: Analyzing trace with hash 277520530, now seen corresponding path program 12 times [2025-03-08 05:43:20,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:20,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652475040] [2025-03-08 05:43:20,747 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:43:20,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:20,757 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 460 statements into 54 equivalence classes. [2025-03-08 05:43:20,776 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) and asserted 221 of 460 statements. [2025-03-08 05:43:20,776 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2025-03-08 05:43:20,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:21,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 525 proven. 1830 refuted. 0 times theorem prover too weak. 10032 trivial. 0 not checked. [2025-03-08 05:43:21,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:21,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652475040] [2025-03-08 05:43:21,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652475040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:21,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823742921] [2025-03-08 05:43:21,086 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:43:21,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:21,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:21,088 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:21,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 05:43:21,219 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 460 statements into 54 equivalence classes. [2025-03-08 05:43:21,265 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) and asserted 221 of 460 statements. [2025-03-08 05:43:21,265 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2025-03-08 05:43:21,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:21,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 05:43:21,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 508 proven. 1816 refuted. 0 times theorem prover too weak. 10063 trivial. 0 not checked. [2025-03-08 05:43:21,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 512 proven. 1869 refuted. 0 times theorem prover too weak. 10006 trivial. 0 not checked. [2025-03-08 05:43:22,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823742921] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:22,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:22,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 17] total 27 [2025-03-08 05:43:22,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081286154] [2025-03-08 05:43:22,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:22,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 05:43:22,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:22,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 05:43:22,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:43:22,876 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 27 states, 23 states have (on average 3.0) internal successors, (69), 27 states have internal predecessors, (69), 19 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (27), 13 states have call predecessors, (27), 19 states have call successors, (27) [2025-03-08 05:43:23,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:23,265 INFO L93 Difference]: Finished difference Result 146 states and 209 transitions. [2025-03-08 05:43:23,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 05:43:23,265 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 3.0) internal successors, (69), 27 states have internal predecessors, (69), 19 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (27), 13 states have call predecessors, (27), 19 states have call successors, (27) Word has length 460 [2025-03-08 05:43:23,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:23,267 INFO L225 Difference]: With dead ends: 146 [2025-03-08 05:43:23,267 INFO L226 Difference]: Without dead ends: 142 [2025-03-08 05:43:23,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 908 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=645, Invalid=1517, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 05:43:23,269 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 118 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:23,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 128 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:23,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-08 05:43:23,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 122. [2025-03-08 05:43:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 85 states have internal predecessors, (89), 24 states have call successors, (24), 19 states have call predecessors, (24), 10 states have return successors, (65), 17 states have call predecessors, (65), 24 states have call successors, (65) [2025-03-08 05:43:23,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2025-03-08 05:43:23,283 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 460 [2025-03-08 05:43:23,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:23,283 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2025-03-08 05:43:23,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 3.0) internal successors, (69), 27 states have internal predecessors, (69), 19 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (27), 13 states have call predecessors, (27), 19 states have call successors, (27) [2025-03-08 05:43:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2025-03-08 05:43:23,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2025-03-08 05:43:23,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:23,289 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:23,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 05:43:23,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 05:43:23,490 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:23,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:23,490 INFO L85 PathProgramCache]: Analyzing trace with hash -671802956, now seen corresponding path program 13 times [2025-03-08 05:43:23,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:23,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326355795] [2025-03-08 05:43:23,491 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 05:43:23,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:23,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 746 statements into 1 equivalence classes. [2025-03-08 05:43:23,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 746 of 746 statements. [2025-03-08 05:43:23,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:43:23,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:24,204 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2025-03-08 05:43:24,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:24,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326355795] [2025-03-08 05:43:24,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326355795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:24,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604268112] [2025-03-08 05:43:24,205 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 05:43:24,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:24,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:24,207 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:24,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 05:43:24,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 746 statements into 1 equivalence classes. [2025-03-08 05:43:24,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 746 of 746 statements. [2025-03-08 05:43:24,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:43:24,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:24,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 1676 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 05:43:24,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2025-03-08 05:43:24,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4480 refuted. 0 times theorem prover too weak. 27957 trivial. 0 not checked. [2025-03-08 05:43:27,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604268112] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:27,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:27,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2025-03-08 05:43:27,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955292182] [2025-03-08 05:43:27,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:27,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 05:43:27,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:27,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 05:43:27,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-08 05:43:27,423 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 23 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 23 states have internal predecessors, (70), 20 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (28), 10 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-08 05:43:27,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:27,566 INFO L93 Difference]: Finished difference Result 131 states and 200 transitions. [2025-03-08 05:43:27,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 05:43:27,567 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 23 states have internal predecessors, (70), 20 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (28), 10 states have call predecessors, (28), 20 states have call successors, (28) Word has length 746 [2025-03-08 05:43:27,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:27,569 INFO L225 Difference]: With dead ends: 131 [2025-03-08 05:43:27,569 INFO L226 Difference]: Without dead ends: 127 [2025-03-08 05:43:27,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1519 GetRequests, 1481 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=294, Invalid=636, Unknown=0, NotChecked=0, Total=930 [2025-03-08 05:43:27,570 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 69 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:27,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 100 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:27,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-08 05:43:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-08 05:43:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 88 states have internal predecessors, (92), 25 states have call successors, (25), 19 states have call predecessors, (25), 11 states have return successors, (76), 19 states have call predecessors, (76), 25 states have call successors, (76) [2025-03-08 05:43:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 193 transitions. [2025-03-08 05:43:27,583 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 193 transitions. Word has length 746 [2025-03-08 05:43:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:27,583 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 193 transitions. [2025-03-08 05:43:27,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 23 states have internal predecessors, (70), 20 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (28), 10 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-08 05:43:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions. [2025-03-08 05:43:27,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1319 [2025-03-08 05:43:27,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:27,591 INFO L218 NwaCegarLoop]: trace histogram [193, 193, 156, 96, 96, 96, 96, 96, 96, 96, 60, 37, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:27,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 05:43:27,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:27,792 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:27,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:27,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1914745010, now seen corresponding path program 14 times [2025-03-08 05:43:27,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:27,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126608760] [2025-03-08 05:43:27,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:43:27,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:27,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1318 statements into 2 equivalence classes. [2025-03-08 05:43:27,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1318 of 1318 statements. [2025-03-08 05:43:27,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:43:27,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:29,204 INFO L134 CoverageAnalysis]: Checked inductivity of 104442 backedges. 1204 proven. 9076 refuted. 0 times theorem prover too weak. 94162 trivial. 0 not checked. [2025-03-08 05:43:29,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:29,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126608760] [2025-03-08 05:43:29,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126608760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:29,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174123911] [2025-03-08 05:43:29,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:43:29,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:29,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:29,206 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:29,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 05:43:29,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1318 statements into 2 equivalence classes. [2025-03-08 05:43:29,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1318 of 1318 statements. [2025-03-08 05:43:29,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:43:29,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:29,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 2946 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 05:43:29,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:29,680 INFO L134 CoverageAnalysis]: Checked inductivity of 104442 backedges. 1204 proven. 9076 refuted. 0 times theorem prover too weak. 94162 trivial. 0 not checked. [2025-03-08 05:43:29,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 104442 backedges. 1204 proven. 9202 refuted. 0 times theorem prover too weak. 94036 trivial. 0 not checked. [2025-03-08 05:43:34,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174123911] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:34,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:34,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2025-03-08 05:43:34,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297917691] [2025-03-08 05:43:34,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:34,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 05:43:34,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:34,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 05:43:34,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:43:34,515 INFO L87 Difference]: Start difference. First operand 127 states and 193 transitions. Second operand has 25 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 25 states have internal predecessors, (76), 22 states have call successors, (23), 1 states have call predecessors, (23), 11 states have return successors, (31), 11 states have call predecessors, (31), 22 states have call successors, (31) [2025-03-08 05:43:34,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:34,674 INFO L93 Difference]: Finished difference Result 136 states and 217 transitions. [2025-03-08 05:43:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 05:43:34,674 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 25 states have internal predecessors, (76), 22 states have call successors, (23), 1 states have call predecessors, (23), 11 states have return successors, (31), 11 states have call predecessors, (31), 22 states have call successors, (31) Word has length 1318 [2025-03-08 05:43:34,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:34,677 INFO L225 Difference]: With dead ends: 136 [2025-03-08 05:43:34,677 INFO L226 Difference]: Without dead ends: 132 [2025-03-08 05:43:34,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2666 GetRequests, 2624 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=356, Invalid=766, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 05:43:34,678 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 198 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:34,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 113 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:34,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-08 05:43:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-08 05:43:34,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 93 states have (on average 1.021505376344086) internal successors, (95), 91 states have internal predecessors, (95), 26 states have call successors, (26), 19 states have call predecessors, (26), 12 states have return successors, (89), 21 states have call predecessors, (89), 26 states have call successors, (89) [2025-03-08 05:43:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 210 transitions. [2025-03-08 05:43:34,687 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 210 transitions. Word has length 1318 [2025-03-08 05:43:34,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:34,687 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 210 transitions. [2025-03-08 05:43:34,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 25 states have internal predecessors, (76), 22 states have call successors, (23), 1 states have call predecessors, (23), 11 states have return successors, (31), 11 states have call predecessors, (31), 22 states have call successors, (31) [2025-03-08 05:43:34,688 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 210 transitions. [2025-03-08 05:43:34,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2504 [2025-03-08 05:43:34,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:34,711 INFO L218 NwaCegarLoop]: trace histogram [367, 367, 297, 183, 183, 183, 183, 183, 183, 183, 114, 70, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:34,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 05:43:34,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 05:43:34,911 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:34,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:34,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1811166535, now seen corresponding path program 15 times [2025-03-08 05:43:34,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:34,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550868965] [2025-03-08 05:43:34,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:43:34,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:34,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2503 statements into 332 equivalence classes. [2025-03-08 05:43:34,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) and asserted 336 of 2503 statements. [2025-03-08 05:43:34,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2025-03-08 05:43:34,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 379212 backedges. 2375 proven. 19684 refuted. 0 times theorem prover too weak. 357153 trivial. 0 not checked. [2025-03-08 05:43:35,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:35,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550868965] [2025-03-08 05:43:35,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550868965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:35,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780169528] [2025-03-08 05:43:35,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:43:35,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:35,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:35,279 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:35,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 05:43:35,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2503 statements into 332 equivalence classes. [2025-03-08 05:43:35,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) and asserted 336 of 2503 statements. [2025-03-08 05:43:35,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2025-03-08 05:43:35,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:35,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 05:43:35,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:35,800 INFO L134 CoverageAnalysis]: Checked inductivity of 379212 backedges. 2375 proven. 19684 refuted. 0 times theorem prover too weak. 357153 trivial. 0 not checked. [2025-03-08 05:43:35,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 379212 backedges. 2375 proven. 19839 refuted. 0 times theorem prover too weak. 356998 trivial. 0 not checked. [2025-03-08 05:43:43,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780169528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:43,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:43,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2025-03-08 05:43:43,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470395539] [2025-03-08 05:43:43,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:43,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 05:43:43,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:43,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 05:43:43,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:43:43,931 INFO L87 Difference]: Start difference. First operand 132 states and 210 transitions. Second operand has 27 states, 25 states have (on average 3.28) internal successors, (82), 27 states have internal predecessors, (82), 24 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (34), 12 states have call predecessors, (34), 24 states have call successors, (34) [2025-03-08 05:43:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:44,137 INFO L93 Difference]: Finished difference Result 141 states and 236 transitions. [2025-03-08 05:43:44,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:43:44,138 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.28) internal successors, (82), 27 states have internal predecessors, (82), 24 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (34), 12 states have call predecessors, (34), 24 states have call successors, (34) Word has length 2503 [2025-03-08 05:43:44,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:44,141 INFO L225 Difference]: With dead ends: 141 [2025-03-08 05:43:44,141 INFO L226 Difference]: Without dead ends: 137 [2025-03-08 05:43:44,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5039 GetRequests, 4993 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=424, Invalid=908, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 05:43:44,142 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 144 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:44,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 136 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:44,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-08 05:43:44,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-08 05:43:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 94 states have internal predecessors, (98), 27 states have call successors, (27), 19 states have call predecessors, (27), 13 states have return successors, (104), 23 states have call predecessors, (104), 27 states have call successors, (104) [2025-03-08 05:43:44,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 229 transitions. [2025-03-08 05:43:44,151 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 229 transitions. Word has length 2503 [2025-03-08 05:43:44,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:44,151 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 229 transitions. [2025-03-08 05:43:44,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.28) internal successors, (82), 27 states have internal predecessors, (82), 24 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (34), 12 states have call predecessors, (34), 24 states have call successors, (34) [2025-03-08 05:43:44,151 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 229 transitions. [2025-03-08 05:43:44,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6290 [2025-03-08 05:43:44,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:44,301 INFO L218 NwaCegarLoop]: trace histogram [923, 923, 747, 461, 461, 461, 461, 461, 461, 461, 286, 176, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:44,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 05:43:44,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 05:43:44,501 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:44,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:44,503 INFO L85 PathProgramCache]: Analyzing trace with hash 554525801, now seen corresponding path program 16 times [2025-03-08 05:43:44,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:44,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554175768] [2025-03-08 05:43:44,503 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:43:44,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:44,582 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 6289 statements into 2 equivalence classes. [2025-03-08 05:43:45,954 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 5363 of 6289 statements. [2025-03-08 05:43:45,954 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:43:45,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:44:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2404763 backedges. 9996 proven. 90469 refuted. 0 times theorem prover too weak. 2304298 trivial. 0 not checked. [2025-03-08 05:44:13,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:44:13,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554175768] [2025-03-08 05:44:13,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554175768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:44:13,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495389969] [2025-03-08 05:44:13,772 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:44:13,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:44:13,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:44:13,774 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:44:13,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 05:44:14,273 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 6289 statements into 2 equivalence classes. [2025-03-08 05:44:15,031 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 5363 of 6289 statements. [2025-03-08 05:44:15,031 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:44:15,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:44:15,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 11190 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 05:44:15,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:44:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2404763 backedges. 721681 proven. 9994 refuted. 0 times theorem prover too weak. 1673088 trivial. 0 not checked. [2025-03-08 05:44:15,363 INFO L312 TraceCheckSpWp]: Computing backward predicates...