./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_10-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_10-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 acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:32:51,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:32:51,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:32:51,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:32:51,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:32:51,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:32:51,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:32:51,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:32:51,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:32:51,934 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:32:51,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:32:51,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:32:51,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:32:51,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:32:51,935 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:32:51,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:32:51,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:32:51,935 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:32:51,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:32:51,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:32:51,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:32:51,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:32:51,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:32:51,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:32:51,936 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:32:51,936 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:32:51,936 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:32:51,936 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:32:51,936 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:32:51,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:32:51,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:32:51,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:32:51,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:32:51,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:32:51,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:32:51,937 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:32:51,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:32:51,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:32:51,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:32:51,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:32:51,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:32:51,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:32:51,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:32:51,938 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 -> acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 [2025-03-03 14:32:52,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:32:52,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:32:52,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:32:52,177 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:32:52,177 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:32:52,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2025-03-03 14:32:53,292 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68da166d/eb283392914f42aa9fb0763e8d7f9287/FLAG8d7c08367 [2025-03-03 14:32:53,478 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:32:53,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2025-03-03 14:32:53,488 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68da166d/eb283392914f42aa9fb0763e8d7f9287/FLAG8d7c08367 [2025-03-03 14:32:53,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68da166d/eb283392914f42aa9fb0763e8d7f9287 [2025-03-03 14:32:53,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:32:53,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:32:53,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:32:53,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:32:53,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:32:53,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:32:53" (1/1) ... [2025-03-03 14:32:53,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c414cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:53, skipping insertion in model container [2025-03-03 14:32:53,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:32:53" (1/1) ... [2025-03-03 14:32:53,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:32:53,961 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_10-1.c[743,756] [2025-03-03 14:32:53,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:32:53,971 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:32:53,981 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_10-1.c[743,756] [2025-03-03 14:32:53,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:32:53,990 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:32:53,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:53 WrapperNode [2025-03-03 14:32:53,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:32:53,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:32:53,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:32:53,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:32:53,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:53" (1/1) ... [2025-03-03 14:32:54,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:53" (1/1) ... [2025-03-03 14:32:54,009 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2025-03-03 14:32:54,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:32:54,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:32:54,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:32:54,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:32:54,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:53" (1/1) ... [2025-03-03 14:32:54,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:53" (1/1) ... [2025-03-03 14:32:54,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:53" (1/1) ... [2025-03-03 14:32:54,023 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-03 14:32:54,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:53" (1/1) ... [2025-03-03 14:32:54,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:53" (1/1) ... [2025-03-03 14:32:54,027 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:53" (1/1) ... [2025-03-03 14:32:54,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:53" (1/1) ... [2025-03-03 14:32:54,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:53" (1/1) ... [2025-03-03 14:32:54,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:53" (1/1) ... [2025-03-03 14:32:54,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:32:54,033 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:32:54,033 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:32:54,033 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:32:54,034 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:53" (1/1) ... [2025-03-03 14:32:54,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:32:54,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:54,058 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-03 14:32:54,061 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-03 14:32:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:32:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:32:54,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:32:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:32:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2025-03-03 14:32:54,082 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2025-03-03 14:32:54,120 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:32:54,121 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:32:54,193 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13: havoc #t~ret4;havoc #t~ret5; [2025-03-03 14:32:54,203 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-03 14:32:54,204 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:32:54,212 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:32:54,212 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:32:54,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:32:54 BoogieIcfgContainer [2025-03-03 14:32:54,213 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:32:54,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:32:54,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:32:54,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:32:54,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:32:53" (1/3) ... [2025-03-03 14:32:54,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c55869e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:32:54, skipping insertion in model container [2025-03-03 14:32:54,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:53" (2/3) ... [2025-03-03 14:32:54,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c55869e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:32:54, skipping insertion in model container [2025-03-03 14:32:54,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:32:54" (3/3) ... [2025-03-03 14:32:54,220 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2025-03-03 14:32:54,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:32:54,233 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_10-1.c that has 2 procedures, 20 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 14:32:54,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:32:54,282 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;@470863a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:32:54,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:32:54,287 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-03 14:32:54,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 14:32:54,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:54,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:54,293 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:54,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:54,297 INFO L85 PathProgramCache]: Analyzing trace with hash 402921910, now seen corresponding path program 1 times [2025-03-03 14:32:54,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:54,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002550609] [2025-03-03 14:32:54,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:54,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:54,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 14:32:54,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 14:32:54,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:54,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:54,447 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-03 14:32:54,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:54,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002550609] [2025-03-03 14:32:54,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002550609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:32:54,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:32:54,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:32:54,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893932088] [2025-03-03 14:32:54,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:32:54,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:32:54,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:54,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:32:54,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:32:54,465 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-03 14:32:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:54,499 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-03-03 14:32:54,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:32:54,501 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-03 14:32:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:54,504 INFO L225 Difference]: With dead ends: 30 [2025-03-03 14:32:54,504 INFO L226 Difference]: Without dead ends: 18 [2025-03-03 14:32:54,506 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-03 14:32:54,508 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-03 14:32:54,509 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-03 14:32:54,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-03 14:32:54,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-03 14:32:54,526 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-03 14:32:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-03 14:32:54,530 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2025-03-03 14:32:54,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:54,530 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-03 14:32:54,530 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-03 14:32:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-03 14:32:54,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 14:32:54,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:54,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:54,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:32:54,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:54,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:54,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2143228819, now seen corresponding path program 1 times [2025-03-03 14:32:54,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:54,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369829696] [2025-03-03 14:32:54,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:54,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:54,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 14:32:54,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 14:32:54,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:54,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:54,604 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-03 14:32:54,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:54,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369829696] [2025-03-03 14:32:54,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369829696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:32:54,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:32:54,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:32:54,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450572339] [2025-03-03 14:32:54,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:32:54,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:32:54,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:54,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:32:54,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:32:54,606 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-03 14:32:54,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:54,619 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-03-03 14:32:54,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:32:54,619 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-03 14:32:54,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:54,620 INFO L225 Difference]: With dead ends: 24 [2025-03-03 14:32:54,620 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 14:32:54,620 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-03 14:32:54,621 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-03 14:32:54,621 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-03 14:32:54,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 14:32:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-03 14:32:54,624 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-03 14:32:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-03 14:32:54,624 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2025-03-03 14:32:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:54,624 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-03 14:32:54,624 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-03 14:32:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-03 14:32:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 14:32:54,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:54,625 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-03 14:32:54,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:32:54,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:54,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:54,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1857137997, now seen corresponding path program 1 times [2025-03-03 14:32:54,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:54,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590189197] [2025-03-03 14:32:54,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:54,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:54,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 14:32:54,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 14:32:54,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:54,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:54,715 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-03 14:32:54,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:54,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590189197] [2025-03-03 14:32:54,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590189197] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:54,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726580869] [2025-03-03 14:32:54,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:54,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:54,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:54,718 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-03 14:32:54,719 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-03 14:32:54,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 14:32:54,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 14:32:54,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:54,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:54,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:32:54,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:54,820 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-03 14:32:54,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:55,033 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-03 14:32:55,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726580869] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:55,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:55,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2025-03-03 14:32:55,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605486076] [2025-03-03 14:32:55,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:55,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:32:55,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:55,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:32:55,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:32:55,034 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-03 14:32:55,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:55,108 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2025-03-03 14:32:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:32:55,109 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-03 14:32:55,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:55,110 INFO L225 Difference]: With dead ends: 35 [2025-03-03 14:32:55,110 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 14:32:55,110 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-03 14:32:55,110 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.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:55,110 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.0s Time] [2025-03-03 14:32:55,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 14:32:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-03 14:32:55,116 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-03 14:32:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-03-03 14:32:55,117 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2025-03-03 14:32:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:55,117 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-03-03 14:32:55,117 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-03 14:32:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-03-03 14:32:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 14:32:55,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:55,118 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-03 14:32:55,126 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-03 14:32:55,324 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-03 14:32:55,324 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:55,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:55,324 INFO L85 PathProgramCache]: Analyzing trace with hash -318077138, now seen corresponding path program 1 times [2025-03-03 14:32:55,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:55,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89971632] [2025-03-03 14:32:55,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:55,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:55,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 14:32:55,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 14:32:55,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:55,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:55,419 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-03 14:32:55,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:55,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89971632] [2025-03-03 14:32:55,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89971632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:55,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437707552] [2025-03-03 14:32:55,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:55,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:55,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:55,422 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-03 14:32:55,423 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-03 14:32:55,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 14:32:55,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 14:32:55,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:55,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:55,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:32:55,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:55,483 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-03 14:32:55,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:55,619 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-03 14:32:55,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437707552] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:55,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:55,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2025-03-03 14:32:55,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953566212] [2025-03-03 14:32:55,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:55,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:32:55,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:55,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:32:55,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:32:55,620 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-03 14:32:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:55,678 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2025-03-03 14:32:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:32:55,679 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-03 14:32:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:55,680 INFO L225 Difference]: With dead ends: 29 [2025-03-03 14:32:55,680 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 14:32:55,680 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-03 14:32:55,681 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-03 14:32:55,681 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-03 14:32:55,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 14:32:55,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-03 14:32:55,684 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-03 14:32:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-03-03 14:32:55,685 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 24 [2025-03-03 14:32:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:55,685 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-03 14:32:55,685 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-03 14:32:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-03-03 14:32:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 14:32:55,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:55,686 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-03 14:32:55,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:32:55,886 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-03 14:32:55,887 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:55,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:55,887 INFO L85 PathProgramCache]: Analyzing trace with hash -896080901, now seen corresponding path program 2 times [2025-03-03 14:32:55,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:55,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613539170] [2025-03-03 14:32:55,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:32:55,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:55,894 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-03 14:32:55,902 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:32:55,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:32:55,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:56,098 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-03 14:32:56,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:56,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613539170] [2025-03-03 14:32:56,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613539170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:56,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073385123] [2025-03-03 14:32:56,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:32:56,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:56,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:56,101 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-03 14:32:56,103 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-03 14:32:56,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-03 14:32:56,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:32:56,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:32:56,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:56,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:32:56,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:56,217 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-03 14:32:56,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:56,511 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-03 14:32:56,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073385123] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:56,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:56,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 20 [2025-03-03 14:32:56,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465901857] [2025-03-03 14:32:56,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:56,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 14:32:56,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:56,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 14:32:56,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:32:56,514 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-03 14:32:56,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:56,764 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2025-03-03 14:32:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:32:56,765 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-03 14:32:56,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:56,766 INFO L225 Difference]: With dead ends: 46 [2025-03-03 14:32:56,766 INFO L226 Difference]: Without dead ends: 42 [2025-03-03 14:32:56,767 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-03 14:32:56,770 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:56,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:56,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-03 14:32:56,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2025-03-03 14:32:56,779 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-03 14:32:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. [2025-03-03 14:32:56,780 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 46 transitions. Word has length 37 [2025-03-03 14:32:56,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:56,780 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 46 transitions. [2025-03-03 14:32:56,781 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-03 14:32:56,781 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 46 transitions. [2025-03-03 14:32:56,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:32:56,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:56,782 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-03 14:32:56,787 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-03 14:32:56,985 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-03 14:32:56,985 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:56,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:56,986 INFO L85 PathProgramCache]: Analyzing trace with hash 525573421, now seen corresponding path program 3 times [2025-03-03 14:32:56,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:56,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45350504] [2025-03-03 14:32:56,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:32:56,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:57,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 12 equivalence classes. [2025-03-03 14:32:57,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 54 of 91 statements. [2025-03-03 14:32:57,012 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 14:32:57,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:57,126 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-03 14:32:57,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:57,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45350504] [2025-03-03 14:32:57,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45350504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:57,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523334547] [2025-03-03 14:32:57,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:32:57,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:57,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:57,129 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-03 14:32:57,130 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-03 14:32:57,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 12 equivalence classes. [2025-03-03 14:32:57,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 54 of 91 statements. [2025-03-03 14:32:57,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 14:32:57,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:57,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:32:57,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:57,198 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-03 14:32:57,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:57,545 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-03 14:32:57,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523334547] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:57,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:57,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 13 [2025-03-03 14:32:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447115012] [2025-03-03 14:32:57,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:57,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 14:32:57,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:57,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 14:32:57,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:32:57,548 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-03 14:32:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:57,656 INFO L93 Difference]: Finished difference Result 62 states and 110 transitions. [2025-03-03 14:32:57,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:32:57,657 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-03 14:32:57,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:57,658 INFO L225 Difference]: With dead ends: 62 [2025-03-03 14:32:57,659 INFO L226 Difference]: Without dead ends: 35 [2025-03-03 14:32:57,659 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-03 14:32:57,660 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-03 14:32:57,661 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-03 14:32:57,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-03 14:32:57,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2025-03-03 14:32:57,670 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-03 14:32:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2025-03-03 14:32:57,670 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 91 [2025-03-03 14:32:57,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:57,670 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2025-03-03 14:32:57,671 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-03 14:32:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2025-03-03 14:32:57,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 14:32:57,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:57,672 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-03 14:32:57,679 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-03 14:32:57,872 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-03 14:32:57,872 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:57,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:57,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1467785241, now seen corresponding path program 4 times [2025-03-03 14:32:57,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:57,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58421812] [2025-03-03 14:32:57,873 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:32:57,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:57,878 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-03 14:32:57,883 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 78 of 93 statements. [2025-03-03 14:32:57,886 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:32:57,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:57,983 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-03 14:32:57,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:57,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58421812] [2025-03-03 14:32:57,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58421812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:57,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545107573] [2025-03-03 14:32:57,984 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:32:57,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:57,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:57,987 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-03 14:32:57,991 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-03 14:32:58,016 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-03 14:32:58,030 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 78 of 93 statements. [2025-03-03 14:32:58,030 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:32:58,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:58,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:32:58,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-03 14:32:58,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 181 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2025-03-03 14:32:58,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545107573] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:58,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:58,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2025-03-03 14:32:58,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957117068] [2025-03-03 14:32:58,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:58,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 14:32:58,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:58,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 14:32:58,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:32:58,492 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-03 14:32:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:58,578 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2025-03-03 14:32:58,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:32:58,579 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) Word has length 93 [2025-03-03 14:32:58,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:58,580 INFO L225 Difference]: With dead ends: 41 [2025-03-03 14:32:58,580 INFO L226 Difference]: Without dead ends: 37 [2025-03-03 14:32:58,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 180 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-03 14:32:58,581 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:58,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 63 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:58,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-03 14:32:58,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-03 14:32:58,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (27), 9 states have call predecessors, (27), 6 states have call successors, (27) [2025-03-03 14:32:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2025-03-03 14:32:58,592 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 93 [2025-03-03 14:32:58,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:58,593 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2025-03-03 14:32:58,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-03 14:32:58,593 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2025-03-03 14:32:58,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 14:32:58,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:58,596 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 25, 14, 14, 14, 14, 14, 14, 14, 11, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:58,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:32:58,797 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-03 14:32:58,797 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:58,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:58,797 INFO L85 PathProgramCache]: Analyzing trace with hash -398227603, now seen corresponding path program 5 times [2025-03-03 14:32:58,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:58,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519447216] [2025-03-03 14:32:58,798 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:32:58,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:58,804 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 203 statements into 24 equivalence classes. [2025-03-03 14:32:58,814 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 81 of 203 statements. [2025-03-03 14:32:58,816 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-03 14:32:58,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 259 proven. 360 refuted. 0 times theorem prover too weak. 1669 trivial. 0 not checked. [2025-03-03 14:32:58,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:58,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519447216] [2025-03-03 14:32:58,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519447216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:58,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894084486] [2025-03-03 14:32:58,923 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:32:58,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:58,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:58,925 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-03 14:32:58,927 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-03 14:32:58,961 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 203 statements into 24 equivalence classes. [2025-03-03 14:32:58,981 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 81 of 203 statements. [2025-03-03 14:32:58,981 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-03 14:32:58,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:58,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:32:58,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:59,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 1311 proven. 33 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-03-03 14:32:59,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 281 proven. 428 refuted. 0 times theorem prover too weak. 1579 trivial. 0 not checked. [2025-03-03 14:32:59,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894084486] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:59,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:59,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 16 [2025-03-03 14:32:59,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104104709] [2025-03-03 14:32:59,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:59,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 14:32:59,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:59,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 14:32:59,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:32:59,725 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 9 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 6 states have call predecessors, (18), 9 states have call successors, (18) [2025-03-03 14:32:59,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:59,836 INFO L93 Difference]: Finished difference Result 85 states and 174 transitions. [2025-03-03 14:32:59,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:32:59,836 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 9 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 6 states have call predecessors, (18), 9 states have call successors, (18) Word has length 203 [2025-03-03 14:32:59,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:59,838 INFO L225 Difference]: With dead ends: 85 [2025-03-03 14:32:59,838 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 14:32:59,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 396 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:32:59,839 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:59,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 105 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:59,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 14:32:59,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2025-03-03 14:32:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 7 states have call successors, (7), 3 states have call predecessors, (7), 7 states have return successors, (35), 11 states have call predecessors, (35), 7 states have call successors, (35) [2025-03-03 14:32:59,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 74 transitions. [2025-03-03 14:32:59,849 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 74 transitions. Word has length 203 [2025-03-03 14:32:59,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:59,849 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 74 transitions. [2025-03-03 14:32:59,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 9 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 6 states have call predecessors, (18), 9 states have call successors, (18) [2025-03-03 14:32:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 74 transitions. [2025-03-03 14:32:59,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 14:32:59,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:59,854 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 23, 13, 13, 13, 13, 13, 13, 13, 10, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:59,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:33:00,055 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-03 14:33:00,055 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:00,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:00,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1403071511, now seen corresponding path program 6 times [2025-03-03 14:33:00,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:00,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149359418] [2025-03-03 14:33:00,056 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:33:00,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:00,062 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 189 statements into 22 equivalence classes. [2025-03-03 14:33:00,079 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 92 of 189 statements. [2025-03-03 14:33:00,079 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-03 14:33:00,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 612 proven. 39 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2025-03-03 14:33:00,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:00,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149359418] [2025-03-03 14:33:00,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149359418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:00,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749998354] [2025-03-03 14:33:00,204 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:33:00,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:00,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:00,206 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-03 14:33:00,207 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-03 14:33:00,246 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 189 statements into 22 equivalence classes. [2025-03-03 14:33:00,267 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 92 of 189 statements. [2025-03-03 14:33:00,268 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-03 14:33:00,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:00,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:33:00,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:00,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 586 proven. 43 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2025-03-03 14:33:00,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 586 proven. 46 refuted. 0 times theorem prover too weak. 1337 trivial. 0 not checked. [2025-03-03 14:33:00,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749998354] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:00,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:00,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 15 [2025-03-03 14:33:00,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230117736] [2025-03-03 14:33:00,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:00,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 14:33:00,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:00,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 14:33:00,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:33:00,846 INFO L87 Difference]: Start difference. First operand 45 states and 74 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 9 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 6 states have call predecessors, (14), 9 states have call successors, (14) [2025-03-03 14:33:00,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:00,943 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2025-03-03 14:33:00,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:33:00,943 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 9 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 6 states have call predecessors, (14), 9 states have call successors, (14) Word has length 189 [2025-03-03 14:33:00,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:00,944 INFO L225 Difference]: With dead ends: 87 [2025-03-03 14:33:00,944 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 14:33:00,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 372 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:33:00,945 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:00,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 75 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:00,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 14:33:00,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-03 14:33:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 30 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-03 14:33:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2025-03-03 14:33:00,951 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 189 [2025-03-03 14:33:00,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:00,951 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2025-03-03 14:33:00,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 9 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 6 states have call predecessors, (14), 9 states have call successors, (14) [2025-03-03 14:33:00,952 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2025-03-03 14:33:00,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:33:00,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:00,953 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:00,959 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-03 14:33:01,153 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-03 14:33:01,153 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:01,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:01,154 INFO L85 PathProgramCache]: Analyzing trace with hash -240813463, now seen corresponding path program 7 times [2025-03-03 14:33:01,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:01,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550680171] [2025-03-03 14:33:01,154 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:33:01,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:01,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:33:01,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:33:01,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:33:01,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:01,294 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 326 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-03 14:33:01,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:01,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550680171] [2025-03-03 14:33:01,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550680171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:01,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906479320] [2025-03-03 14:33:01,294 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:33:01,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:01,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:01,297 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-03 14:33:01,298 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-03 14:33:01,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:33:01,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:33:01,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:33:01,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:01,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 14:33:01,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 326 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-03 14:33:01,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:02,004 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 352 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2025-03-03 14:33:02,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906479320] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:02,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:02,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2025-03-03 14:33:02,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212304893] [2025-03-03 14:33:02,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:02,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 14:33:02,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:02,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 14:33:02,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:33:02,006 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 15 states have internal predecessors, (46), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 6 states have call predecessors, (16), 12 states have call successors, (16) [2025-03-03 14:33:02,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:02,088 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2025-03-03 14:33:02,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:33:02,088 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 15 states have internal predecessors, (46), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 6 states have call predecessors, (16), 12 states have call successors, (16) Word has length 133 [2025-03-03 14:33:02,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:02,089 INFO L225 Difference]: With dead ends: 54 [2025-03-03 14:33:02,090 INFO L226 Difference]: Without dead ends: 50 [2025-03-03 14:33:02,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 259 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2025-03-03 14:33:02,091 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:02,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 73 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:02,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-03 14:33:02,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-03 14:33:02,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 33 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (24), 11 states have call predecessors, (24), 7 states have call successors, (24) [2025-03-03 14:33:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2025-03-03 14:33:02,098 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 133 [2025-03-03 14:33:02,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:02,098 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 69 transitions. [2025-03-03 14:33:02,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 15 states have internal predecessors, (46), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 6 states have call predecessors, (16), 12 states have call successors, (16) [2025-03-03 14:33:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2025-03-03 14:33:02,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-03 14:33:02,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:02,101 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:02,107 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-03 14:33:02,302 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-03 14:33:02,302 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:02,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:02,303 INFO L85 PathProgramCache]: Analyzing trace with hash -555793953, now seen corresponding path program 8 times [2025-03-03 14:33:02,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:02,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672209835] [2025-03-03 14:33:02,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:33:02,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:02,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 215 statements into 2 equivalence classes. [2025-03-03 14:33:02,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 14:33:02,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:33:02,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:02,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2025-03-03 14:33:02,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:02,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672209835] [2025-03-03 14:33:02,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672209835] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:02,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066684200] [2025-03-03 14:33:02,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:33:02,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:02,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:02,501 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-03 14:33:02,502 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-03 14:33:02,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 215 statements into 2 equivalence classes. [2025-03-03 14:33:02,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 14:33:02,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:33:02,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:02,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 14:33:02,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2025-03-03 14:33:02,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 756 refuted. 0 times theorem prover too weak. 1716 trivial. 0 not checked. [2025-03-03 14:33:03,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066684200] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:03,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:03,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2025-03-03 14:33:03,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484819977] [2025-03-03 14:33:03,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:03,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 14:33:03,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:03,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 14:33:03,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:33:03,595 INFO L87 Difference]: Start difference. First operand 50 states and 69 transitions. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) [2025-03-03 14:33:03,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:03,705 INFO L93 Difference]: Finished difference Result 59 states and 87 transitions. [2025-03-03 14:33:03,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:33:03,706 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) Word has length 215 [2025-03-03 14:33:03,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:03,707 INFO L225 Difference]: With dead ends: 59 [2025-03-03 14:33:03,707 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 14:33:03,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 422 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:33:03,708 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:03,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 81 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:03,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 14:33:03,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-03 14:33:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 36 states have internal predecessors, (41), 8 states have call successors, (8), 5 states have call predecessors, (8), 8 states have return successors, (34), 13 states have call predecessors, (34), 8 states have call successors, (34) [2025-03-03 14:33:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2025-03-03 14:33:03,713 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 215 [2025-03-03 14:33:03,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:03,713 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2025-03-03 14:33:03,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) [2025-03-03 14:33:03,714 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2025-03-03 14:33:03,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-03-03 14:33:03,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:03,716 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 42, 25, 25, 25, 25, 25, 25, 25, 17, 9, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:03,722 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-03 14:33:03,920 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-03 14:33:03,920 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:03,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:03,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1141176494, now seen corresponding path program 9 times [2025-03-03 14:33:03,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:03,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742551308] [2025-03-03 14:33:03,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:33:03,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:03,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 352 statements into 45 equivalence classes. [2025-03-03 14:33:03,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 131 of 352 statements. [2025-03-03 14:33:03,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-03 14:33:03,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 1156 proven. 178 refuted. 0 times theorem prover too weak. 5827 trivial. 0 not checked. [2025-03-03 14:33:04,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:04,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742551308] [2025-03-03 14:33:04,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742551308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:04,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942946447] [2025-03-03 14:33:04,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:33:04,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:04,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:04,034 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-03 14:33:04,035 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-03 14:33:04,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 352 statements into 45 equivalence classes. [2025-03-03 14:33:04,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 131 of 352 statements. [2025-03-03 14:33:04,125 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-03 14:33:04,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:04,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:33:04,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 2348 proven. 66 refuted. 0 times theorem prover too weak. 4747 trivial. 0 not checked. [2025-03-03 14:33:04,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 1156 proven. 182 refuted. 0 times theorem prover too weak. 5823 trivial. 0 not checked. [2025-03-03 14:33:04,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942946447] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:04,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:04,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 15 [2025-03-03 14:33:04,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542460512] [2025-03-03 14:33:04,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:04,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 14:33:04,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:04,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 14:33:04,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:33:04,936 INFO L87 Difference]: Start difference. First operand 55 states and 83 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 7 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (20), 9 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-03 14:33:05,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:05,081 INFO L93 Difference]: Finished difference Result 120 states and 203 transitions. [2025-03-03 14:33:05,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 14:33:05,082 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 7 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (20), 9 states have call predecessors, (20), 7 states have call successors, (20) Word has length 352 [2025-03-03 14:33:05,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:05,083 INFO L225 Difference]: With dead ends: 120 [2025-03-03 14:33:05,083 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 14:33:05,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 695 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=203, Invalid=447, Unknown=0, NotChecked=0, Total=650 [2025-03-03 14:33:05,084 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 46 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:05,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 78 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:05,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 14:33:05,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2025-03-03 14:33:05,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 41 states have internal predecessors, (47), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (30), 13 states have call predecessors, (30), 9 states have call successors, (30) [2025-03-03 14:33:05,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2025-03-03 14:33:05,090 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 352 [2025-03-03 14:33:05,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:05,090 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2025-03-03 14:33:05,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 7 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (20), 9 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-03 14:33:05,091 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2025-03-03 14:33:05,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-03 14:33:05,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:05,092 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 43, 26, 26, 26, 26, 26, 26, 26, 17, 10, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:05,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 14:33:05,292 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-03 14:33:05,293 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:05,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:05,293 INFO L85 PathProgramCache]: Analyzing trace with hash 851115205, now seen corresponding path program 10 times [2025-03-03 14:33:05,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:05,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362782152] [2025-03-03 14:33:05,293 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:33:05,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:05,301 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 365 statements into 2 equivalence classes. [2025-03-03 14:33:05,329 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 310 of 365 statements. [2025-03-03 14:33:05,329 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:33:05,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7715 backedges. 240 proven. 1545 refuted. 0 times theorem prover too weak. 5930 trivial. 0 not checked. [2025-03-03 14:33:05,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:05,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362782152] [2025-03-03 14:33:05,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362782152] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:05,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004337849] [2025-03-03 14:33:05,525 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:33:05,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:05,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:05,527 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-03 14:33:05,528 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-03 14:33:05,594 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 365 statements into 2 equivalence classes. [2025-03-03 14:33:05,639 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 310 of 365 statements. [2025-03-03 14:33:05,639 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:33:05,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:05,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 14:33:05,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7715 backedges. 240 proven. 1545 refuted. 0 times theorem prover too weak. 5930 trivial. 0 not checked. [2025-03-03 14:33:05,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7715 backedges. 240 proven. 1602 refuted. 0 times theorem prover too weak. 5873 trivial. 0 not checked. [2025-03-03 14:33:07,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004337849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:07,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:07,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2025-03-03 14:33:07,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496821864] [2025-03-03 14:33:07,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:07,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 14:33:07,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:07,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 14:33:07,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-03 14:33:07,252 INFO L87 Difference]: Start difference. First operand 62 states and 86 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-03 14:33:07,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:07,394 INFO L93 Difference]: Finished difference Result 71 states and 105 transitions. [2025-03-03 14:33:07,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:33:07,394 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 365 [2025-03-03 14:33:07,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:07,396 INFO L225 Difference]: With dead ends: 71 [2025-03-03 14:33:07,396 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 14:33:07,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 721 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-03 14:33:07,397 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 111 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:07,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 92 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:07,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 14:33:07,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-03 14:33:07,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 44 states have internal predecessors, (50), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (41), 15 states have call predecessors, (41), 10 states have call successors, (41) [2025-03-03 14:33:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2025-03-03 14:33:07,409 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 365 [2025-03-03 14:33:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:07,409 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2025-03-03 14:33:07,410 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-03 14:33:07,410 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2025-03-03 14:33:07,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2025-03-03 14:33:07,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:07,413 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 89, 55, 55, 55, 55, 55, 55, 55, 34, 22, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:07,420 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-03 14:33:07,613 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-03 14:33:07,614 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:07,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:07,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1000639375, now seen corresponding path program 11 times [2025-03-03 14:33:07,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:07,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41409166] [2025-03-03 14:33:07,614 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:33:07,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:07,629 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 759 statements into 90 equivalence classes. [2025-03-03 14:33:07,648 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) and asserted 240 of 759 statements. [2025-03-03 14:33:07,648 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2025-03-03 14:33:07,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 34276 backedges. 2098 proven. 3230 refuted. 0 times theorem prover too weak. 28948 trivial. 0 not checked. [2025-03-03 14:33:07,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:07,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41409166] [2025-03-03 14:33:07,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41409166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:07,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072256636] [2025-03-03 14:33:07,929 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:33:07,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:07,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:07,931 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-03 14:33:07,933 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-03 14:33:08,033 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 759 statements into 90 equivalence classes. [2025-03-03 14:33:08,085 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) and asserted 240 of 759 statements. [2025-03-03 14:33:08,085 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2025-03-03 14:33:08,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:08,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 14:33:08,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 34276 backedges. 18559 proven. 356 refuted. 0 times theorem prover too weak. 15361 trivial. 0 not checked. [2025-03-03 14:33:08,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 34276 backedges. 2224 proven. 3496 refuted. 0 times theorem prover too weak. 28556 trivial. 0 not checked. [2025-03-03 14:33:10,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072256636] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:10,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:10,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 19] total 28 [2025-03-03 14:33:10,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336411281] [2025-03-03 14:33:10,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:10,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 14:33:10,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:10,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 14:33:10,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:33:10,428 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 28 states, 27 states have (on average 3.185185185185185) internal successors, (86), 28 states have internal predecessors, (86), 21 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (34), 12 states have call predecessors, (34), 21 states have call successors, (34) [2025-03-03 14:33:10,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:10,675 INFO L93 Difference]: Finished difference Result 140 states and 245 transitions. [2025-03-03 14:33:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 14:33:10,676 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.185185185185185) internal successors, (86), 28 states have internal predecessors, (86), 21 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (34), 12 states have call predecessors, (34), 21 states have call successors, (34) Word has length 759 [2025-03-03 14:33:10,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:10,677 INFO L225 Difference]: With dead ends: 140 [2025-03-03 14:33:10,677 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 14:33:10,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1553 GetRequests, 1502 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=485, Invalid=1407, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 14:33:10,678 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 115 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:10,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 120 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:10,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 14:33:10,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2025-03-03 14:33:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.06) internal successors, (53), 47 states have internal predecessors, (53), 11 states have call successors, (11), 8 states have call predecessors, (11), 9 states have return successors, (38), 15 states have call predecessors, (38), 11 states have call successors, (38) [2025-03-03 14:33:10,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2025-03-03 14:33:10,685 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 759 [2025-03-03 14:33:10,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:10,685 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2025-03-03 14:33:10,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.185185185185185) internal successors, (86), 28 states have internal predecessors, (86), 21 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (34), 12 states have call predecessors, (34), 21 states have call successors, (34) [2025-03-03 14:33:10,685 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2025-03-03 14:33:10,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-03 14:33:10,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:10,687 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-03 14:33:10,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 14:33:10,887 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-03 14:33:10,888 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:10,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:10,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2121070825, now seen corresponding path program 12 times [2025-03-03 14:33:10,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:10,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811963505] [2025-03-03 14:33:10,888 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:33:10,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:10,899 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 569 statements into 78 equivalence classes. [2025-03-03 14:33:10,916 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) and asserted 147 of 569 statements. [2025-03-03 14:33:10,916 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2025-03-03 14:33:10,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 718 proven. 2242 refuted. 0 times theorem prover too weak. 16143 trivial. 0 not checked. [2025-03-03 14:33:11,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:11,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811963505] [2025-03-03 14:33:11,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811963505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:11,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612333470] [2025-03-03 14:33:11,034 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:33:11,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:11,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:11,036 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-03 14:33:11,037 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-03 14:33:11,144 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 569 statements into 78 equivalence classes. [2025-03-03 14:33:11,177 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) and asserted 147 of 569 statements. [2025-03-03 14:33:11,177 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2025-03-03 14:33:11,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:11,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 14:33:11,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:11,254 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 709 proven. 2234 refuted. 0 times theorem prover too weak. 16160 trivial. 0 not checked. [2025-03-03 14:33:11,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 715 proven. 2285 refuted. 0 times theorem prover too weak. 16103 trivial. 0 not checked. [2025-03-03 14:33:13,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612333470] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:13,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:13,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 17] total 20 [2025-03-03 14:33:13,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825452022] [2025-03-03 14:33:13,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:13,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 14:33:13,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:13,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 14:33:13,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:33:13,030 INFO L87 Difference]: Start difference. First operand 71 states and 102 transitions. Second operand has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 20 states have internal predecessors, (62), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (24), 10 states have call predecessors, (24), 16 states have call successors, (24) [2025-03-03 14:33:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:13,194 INFO L93 Difference]: Finished difference Result 258 states and 452 transitions. [2025-03-03 14:33:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:33:13,194 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 20 states have internal predecessors, (62), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (24), 10 states have call predecessors, (24), 16 states have call successors, (24) Word has length 569 [2025-03-03 14:33:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:13,200 INFO L225 Difference]: With dead ends: 258 [2025-03-03 14:33:13,200 INFO L226 Difference]: Without dead ends: 254 [2025-03-03 14:33:13,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1160 GetRequests, 1128 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=228, Invalid=474, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:33:13,202 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 69 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:13,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 111 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-03 14:33:13,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 183. [2025-03-03 14:33:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 126 states have (on average 1.0634920634920635) internal successors, (134), 119 states have internal predecessors, (134), 35 states have call successors, (35), 20 states have call predecessors, (35), 21 states have return successors, (108), 43 states have call predecessors, (108), 35 states have call successors, (108) [2025-03-03 14:33:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 277 transitions. [2025-03-03 14:33:13,231 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 277 transitions. Word has length 569 [2025-03-03 14:33:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:13,233 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 277 transitions. [2025-03-03 14:33:13,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 20 states have internal predecessors, (62), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (24), 10 states have call predecessors, (24), 16 states have call successors, (24) [2025-03-03 14:33:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 277 transitions. [2025-03-03 14:33:13,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-03-03 14:33:13,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:13,237 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 77, 47, 47, 47, 47, 47, 47, 47, 30, 18, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:13,245 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-03 14:33:13,437 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-03 14:33:13,438 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:13,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:13,438 INFO L85 PathProgramCache]: Analyzing trace with hash -169539397, now seen corresponding path program 13 times [2025-03-03 14:33:13,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:13,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355824088] [2025-03-03 14:33:13,438 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:33:13,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:13,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-03-03 14:33:13,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-03-03 14:33:13,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:33:13,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 473 proven. 3406 refuted. 0 times theorem prover too weak. 21231 trivial. 0 not checked. [2025-03-03 14:33:13,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:13,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355824088] [2025-03-03 14:33:13,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355824088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:13,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69490234] [2025-03-03 14:33:13,943 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:33:13,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:13,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:13,945 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-03 14:33:13,950 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-03 14:33:14,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-03-03 14:33:14,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-03-03 14:33:14,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:33:14,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:14,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 1465 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 14:33:14,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 473 proven. 3406 refuted. 0 times theorem prover too weak. 21231 trivial. 0 not checked. [2025-03-03 14:33:14,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 473 proven. 3483 refuted. 0 times theorem prover too weak. 21154 trivial. 0 not checked. [2025-03-03 14:33:16,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69490234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:16,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:16,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2025-03-03 14:33:16,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539860960] [2025-03-03 14:33:16,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:16,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 14:33:16,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:16,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 14:33:16,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2025-03-03 14:33:16,477 INFO L87 Difference]: Start difference. First operand 183 states and 277 transitions. Second operand has 21 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 21 states have internal predecessors, (64), 18 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 9 states have call predecessors, (25), 18 states have call successors, (25) [2025-03-03 14:33:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:16,631 INFO L93 Difference]: Finished difference Result 284 states and 548 transitions. [2025-03-03 14:33:16,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:33:16,631 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 21 states have internal predecessors, (64), 18 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 9 states have call predecessors, (25), 18 states have call successors, (25) Word has length 651 [2025-03-03 14:33:16,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:16,635 INFO L225 Difference]: With dead ends: 284 [2025-03-03 14:33:16,635 INFO L226 Difference]: Without dead ends: 280 [2025-03-03 14:33:16,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1326 GetRequests, 1292 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=518, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:33:16,637 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 93 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:16,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 97 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:16,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-03 14:33:16,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 195. [2025-03-03 14:33:16,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 133 states have (on average 1.0601503759398496) internal successors, (141), 126 states have internal predecessors, (141), 38 states have call successors, (38), 20 states have call predecessors, (38), 23 states have return successors, (134), 48 states have call predecessors, (134), 38 states have call successors, (134) [2025-03-03 14:33:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 313 transitions. [2025-03-03 14:33:16,662 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 313 transitions. Word has length 651 [2025-03-03 14:33:16,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:16,663 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 313 transitions. [2025-03-03 14:33:16,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 21 states have internal predecessors, (64), 18 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 9 states have call predecessors, (25), 18 states have call successors, (25) [2025-03-03 14:33:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 313 transitions. [2025-03-03 14:33:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2025-03-03 14:33:16,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:16,668 INFO L218 NwaCegarLoop]: trace histogram [127, 127, 103, 63, 63, 63, 63, 63, 63, 63, 40, 24, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:16,675 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-03 14:33:16,868 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-03 14:33:16,868 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:16,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:16,869 INFO L85 PathProgramCache]: Analyzing trace with hash -188142433, now seen corresponding path program 14 times [2025-03-03 14:33:16,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:16,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428419341] [2025-03-03 14:33:16,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:33:16,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:16,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 869 statements into 2 equivalence classes. [2025-03-03 14:33:16,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 869 of 869 statements. [2025-03-03 14:33:16,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:33:16,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 45069 backedges. 788 proven. 5160 refuted. 0 times theorem prover too weak. 39121 trivial. 0 not checked. [2025-03-03 14:33:17,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:17,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428419341] [2025-03-03 14:33:17,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428419341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:17,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537264887] [2025-03-03 14:33:17,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:33:17,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:17,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:17,634 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-03 14:33:17,635 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-03 14:33:17,793 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 869 statements into 2 equivalence classes. [2025-03-03 14:33:17,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 869 of 869 statements. [2025-03-03 14:33:17,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:33:17,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:17,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 1949 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 14:33:17,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 45069 backedges. 788 proven. 5160 refuted. 0 times theorem prover too weak. 39121 trivial. 0 not checked. [2025-03-03 14:33:18,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 45069 backedges. 788 proven. 5260 refuted. 0 times theorem prover too weak. 39021 trivial. 0 not checked. [2025-03-03 14:33:21,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537264887] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:21,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:21,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 22 [2025-03-03 14:33:21,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803321374] [2025-03-03 14:33:21,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:21,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 14:33:21,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:21,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 14:33:21,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:33:21,273 INFO L87 Difference]: Start difference. First operand 195 states and 313 transitions. Second operand has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 19 states have call successors, (20), 1 states have call predecessors, (20), 10 states have return successors, (27), 10 states have call predecessors, (27), 19 states have call successors, (27) [2025-03-03 14:33:21,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:21,467 INFO L93 Difference]: Finished difference Result 311 states and 655 transitions. [2025-03-03 14:33:21,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 14:33:21,468 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 19 states have call successors, (20), 1 states have call predecessors, (20), 10 states have return successors, (27), 10 states have call predecessors, (27), 19 states have call successors, (27) Word has length 869 [2025-03-03 14:33:21,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:21,472 INFO L225 Difference]: With dead ends: 311 [2025-03-03 14:33:21,472 INFO L226 Difference]: Without dead ends: 307 [2025-03-03 14:33:21,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1765 GetRequests, 1727 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=291, Invalid=579, Unknown=0, NotChecked=0, Total=870 [2025-03-03 14:33:21,473 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 117 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:21,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 93 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-03 14:33:21,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 200. [2025-03-03 14:33:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 136 states have (on average 1.0588235294117647) internal successors, (144), 129 states have internal predecessors, (144), 39 states have call successors, (39), 20 states have call predecessors, (39), 24 states have return successors, (148), 50 states have call predecessors, (148), 39 states have call successors, (148) [2025-03-03 14:33:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 331 transitions. [2025-03-03 14:33:21,511 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 331 transitions. Word has length 869 [2025-03-03 14:33:21,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:21,512 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 331 transitions. [2025-03-03 14:33:21,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 19 states have call successors, (20), 1 states have call predecessors, (20), 10 states have return successors, (27), 10 states have call predecessors, (27), 19 states have call successors, (27) [2025-03-03 14:33:21,512 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 331 transitions. [2025-03-03 14:33:21,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1565 [2025-03-03 14:33:21,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:21,523 INFO L218 NwaCegarLoop]: trace histogram [229, 229, 186, 114, 114, 114, 114, 114, 114, 114, 72, 43, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:21,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 14:33:21,723 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-03 14:33:21,723 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:21,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1428154044, now seen corresponding path program 15 times [2025-03-03 14:33:21,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:21,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637456473] [2025-03-03 14:33:21,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:33:21,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:21,747 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1564 statements into 203 equivalence classes. [2025-03-03 14:33:21,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) and asserted 253 of 1564 statements. [2025-03-03 14:33:21,771 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2025-03-03 14:33:21,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:21,928 INFO L134 CoverageAnalysis]: Checked inductivity of 147393 backedges. 8469 proven. 314 refuted. 0 times theorem prover too weak. 138610 trivial. 0 not checked. [2025-03-03 14:33:21,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:21,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637456473] [2025-03-03 14:33:21,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637456473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:21,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101747083] [2025-03-03 14:33:21,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:33:21,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:21,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:21,930 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-03 14:33:21,932 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-03 14:33:22,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1564 statements into 203 equivalence classes. [2025-03-03 14:33:22,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) and asserted 253 of 1564 statements. [2025-03-03 14:33:22,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2025-03-03 14:33:22,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:22,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 14:33:22,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 147393 backedges. 8459 proven. 322 refuted. 0 times theorem prover too weak. 138612 trivial. 0 not checked. [2025-03-03 14:33:22,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 147393 backedges. 8459 proven. 338 refuted. 0 times theorem prover too weak. 138596 trivial. 0 not checked. [2025-03-03 14:33:25,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101747083] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:25,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:25,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 19 [2025-03-03 14:33:25,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460602008] [2025-03-03 14:33:25,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:25,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 14:33:25,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:25,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 14:33:25,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-03-03 14:33:25,554 INFO L87 Difference]: Start difference. First operand 200 states and 331 transitions. Second operand has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 8 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (20), 13 states have call predecessors, (20), 8 states have call successors, (20) [2025-03-03 14:33:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:25,821 INFO L93 Difference]: Finished difference Result 521 states and 1024 transitions. [2025-03-03 14:33:25,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 14:33:25,822 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 8 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (20), 13 states have call predecessors, (20), 8 states have call successors, (20) Word has length 1564 [2025-03-03 14:33:25,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:25,825 INFO L225 Difference]: With dead ends: 521 [2025-03-03 14:33:25,825 INFO L226 Difference]: Without dead ends: 317 [2025-03-03 14:33:25,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3159 GetRequests, 3118 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=361, Invalid=899, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 14:33:25,828 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 88 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:25,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 96 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:25,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-03 14:33:25,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 270. [2025-03-03 14:33:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 181 states have (on average 1.0662983425414365) internal successors, (193), 178 states have internal predecessors, (193), 62 states have call successors, (62), 31 states have call predecessors, (62), 26 states have return successors, (199), 60 states have call predecessors, (199), 62 states have call successors, (199) [2025-03-03 14:33:25,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 454 transitions. [2025-03-03 14:33:25,849 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 454 transitions. Word has length 1564 [2025-03-03 14:33:25,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:25,849 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 454 transitions. [2025-03-03 14:33:25,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 8 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (20), 13 states have call predecessors, (20), 8 states have call successors, (20) [2025-03-03 14:33:25,849 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 454 transitions. [2025-03-03 14:33:25,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2025-03-03 14:33:25,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:25,860 INFO L218 NwaCegarLoop]: trace histogram [219, 219, 177, 109, 109, 109, 109, 109, 109, 109, 68, 42, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:25,867 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-03 14:33:26,061 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-03 14:33:26,062 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:26,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:26,062 INFO L85 PathProgramCache]: Analyzing trace with hash 590953399, now seen corresponding path program 16 times [2025-03-03 14:33:26,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:26,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639406600] [2025-03-03 14:33:26,062 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:33:26,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:26,083 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1495 statements into 2 equivalence classes. [2025-03-03 14:33:26,238 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 1274 of 1495 statements. [2025-03-03 14:33:26,238 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:33:26,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 5891 proven. 3916 refuted. 0 times theorem prover too weak. 124797 trivial. 0 not checked. [2025-03-03 14:33:27,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:27,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639406600] [2025-03-03 14:33:27,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639406600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:27,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392430154] [2025-03-03 14:33:27,273 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:33:27,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:27,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:27,276 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-03 14:33:27,277 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-03 14:33:27,493 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1495 statements into 2 equivalence classes. [2025-03-03 14:33:27,668 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 1274 of 1495 statements. [2025-03-03 14:33:27,668 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:33:27,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:27,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 2660 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 14:33:27,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 6930 proven. 4817 refuted. 0 times theorem prover too weak. 122857 trivial. 0 not checked. [2025-03-03 14:33:27,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:32,926 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 6930 proven. 4934 refuted. 0 times theorem prover too weak. 122740 trivial. 0 not checked. [2025-03-03 14:33:32,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392430154] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:32,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:32,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 23] total 27 [2025-03-03 14:33:32,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316193806] [2025-03-03 14:33:32,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:32,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 14:33:32,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:32,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 14:33:32,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:33:32,928 INFO L87 Difference]: Start difference. First operand 270 states and 454 transitions. Second operand has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 27 states have internal predecessors, (80), 21 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (34), 14 states have call predecessors, (34), 21 states have call successors, (34) [2025-03-03 14:33:33,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:33,139 INFO L93 Difference]: Finished difference Result 669 states and 1872 transitions. [2025-03-03 14:33:33,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:33:33,140 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 27 states have internal predecessors, (80), 21 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (34), 14 states have call predecessors, (34), 21 states have call successors, (34) Word has length 1495 [2025-03-03 14:33:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:33,146 INFO L225 Difference]: With dead ends: 669 [2025-03-03 14:33:33,146 INFO L226 Difference]: Without dead ends: 311 [2025-03-03 14:33:33,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3018 GetRequests, 2973 SyntacticMatches, 11 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=429, Invalid=831, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 14:33:33,151 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 21 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:33,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 192 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:33,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-03 14:33:33,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 301. [2025-03-03 14:33:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 198 states have (on average 1.0505050505050506) internal successors, (208), 195 states have internal predecessors, (208), 63 states have call successors, (63), 26 states have call predecessors, (63), 39 states have return successors, (315), 79 states have call predecessors, (315), 63 states have call successors, (315) [2025-03-03 14:33:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 586 transitions. [2025-03-03 14:33:33,176 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 586 transitions. Word has length 1495 [2025-03-03 14:33:33,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:33,177 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 586 transitions. [2025-03-03 14:33:33,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 27 states have internal predecessors, (80), 21 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (34), 14 states have call predecessors, (34), 21 states have call successors, (34) [2025-03-03 14:33:33,177 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 586 transitions. [2025-03-03 14:33:33,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1332 [2025-03-03 14:33:33,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:33,187 INFO L218 NwaCegarLoop]: trace histogram [195, 195, 157, 97, 97, 97, 97, 97, 97, 97, 60, 38, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:33,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-03 14:33:33,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:33,387 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:33,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:33,388 INFO L85 PathProgramCache]: Analyzing trace with hash 412795531, now seen corresponding path program 17 times [2025-03-03 14:33:33,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:33,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532653456] [2025-03-03 14:33:33,389 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:33:33,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:33,408 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1331 statements into 157 equivalence classes. [2025-03-03 14:33:33,433 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) and asserted 293 of 1331 statements. [2025-03-03 14:33:33,433 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2025-03-03 14:33:33,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 106530 backedges. 3303 proven. 6020 refuted. 0 times theorem prover too weak. 97207 trivial. 0 not checked. [2025-03-03 14:33:33,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:33,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532653456] [2025-03-03 14:33:33,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532653456] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:33,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108290078] [2025-03-03 14:33:33,602 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:33:33,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:33,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:33,604 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:33:33,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 14:33:33,823 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1331 statements into 157 equivalence classes. [2025-03-03 14:33:33,877 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) and asserted 293 of 1331 statements. [2025-03-03 14:33:33,877 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2025-03-03 14:33:33,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:33,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 14:33:33,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 106530 backedges. 47284 proven. 138 refuted. 0 times theorem prover too weak. 59108 trivial. 0 not checked. [2025-03-03 14:33:33,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:37,066 INFO L134 CoverageAnalysis]: Checked inductivity of 106530 backedges. 3293 proven. 6042 refuted. 0 times theorem prover too weak. 97195 trivial. 0 not checked. [2025-03-03 14:33:37,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108290078] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:37,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:37,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 18 [2025-03-03 14:33:37,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81871752] [2025-03-03 14:33:37,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:37,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 14:33:37,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:37,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 14:33:37,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-03-03 14:33:37,069 INFO L87 Difference]: Start difference. First operand 301 states and 586 transitions. Second operand has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (25), 10 states have call predecessors, (25), 13 states have call successors, (25) [2025-03-03 14:33:37,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:37,188 INFO L93 Difference]: Finished difference Result 573 states and 1212 transitions. [2025-03-03 14:33:37,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 14:33:37,189 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (25), 10 states have call predecessors, (25), 13 states have call successors, (25) Word has length 1331 [2025-03-03 14:33:37,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:37,191 INFO L225 Difference]: With dead ends: 573 [2025-03-03 14:33:37,191 INFO L226 Difference]: Without dead ends: 259 [2025-03-03 14:33:37,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2682 GetRequests, 2652 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2025-03-03 14:33:37,195 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 27 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:37,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 112 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-03 14:33:37,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 253. [2025-03-03 14:33:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 171 states have (on average 1.0350877192982457) internal successors, (177), 166 states have internal predecessors, (177), 48 states have call successors, (48), 25 states have call predecessors, (48), 33 states have return successors, (205), 61 states have call predecessors, (205), 48 states have call successors, (205) [2025-03-03 14:33:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 430 transitions. [2025-03-03 14:33:37,217 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 430 transitions. Word has length 1331 [2025-03-03 14:33:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:37,217 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 430 transitions. [2025-03-03 14:33:37,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (25), 10 states have call predecessors, (25), 13 states have call successors, (25) [2025-03-03 14:33:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 430 transitions. [2025-03-03 14:33:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1319 [2025-03-03 14:33:37,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:37,226 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-03 14:33:37,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-03 14:33:37,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:37,427 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:37,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:37,427 INFO L85 PathProgramCache]: Analyzing trace with hash -989677942, now seen corresponding path program 18 times [2025-03-03 14:33:37,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:37,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804556041] [2025-03-03 14:33:37,428 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:33:37,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:37,447 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1318 statements into 161 equivalence classes. [2025-03-03 14:33:37,542 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 86 check-sat command(s) and asserted 747 of 1318 statements. [2025-03-03 14:33:37,542 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 86 check-sat command(s) [2025-03-03 14:33:37,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 104442 backedges. 4161 proven. 5499 refuted. 0 times theorem prover too weak. 94782 trivial. 0 not checked. [2025-03-03 14:33:38,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:38,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804556041] [2025-03-03 14:33:38,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804556041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:38,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911602174] [2025-03-03 14:33:38,293 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:33:38,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:38,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:38,295 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:33:38,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 14:33:38,549 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1318 statements into 161 equivalence classes. [2025-03-03 14:33:38,737 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 86 check-sat command(s) and asserted 747 of 1318 statements. [2025-03-03 14:33:38,737 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 86 check-sat command(s) [2025-03-03 14:33:38,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:38,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 1672 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 14:33:38,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 104442 backedges. 4395 proven. 5894 refuted. 0 times theorem prover too weak. 94153 trivial. 0 not checked. [2025-03-03 14:33:38,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:43,507 INFO L134 CoverageAnalysis]: Checked inductivity of 104442 backedges. 4397 proven. 6009 refuted. 0 times theorem prover too weak. 94036 trivial. 0 not checked. [2025-03-03 14:33:43,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911602174] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:43,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:43,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 23] total 30 [2025-03-03 14:33:43,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761716606] [2025-03-03 14:33:43,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:43,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 14:33:43,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:43,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 14:33:43,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2025-03-03 14:33:43,509 INFO L87 Difference]: Start difference. First operand 253 states and 430 transitions. Second operand has 30 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 30 states have internal predecessors, (87), 24 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (35), 14 states have call predecessors, (35), 24 states have call successors, (35) [2025-03-03 14:33:43,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:43,782 INFO L93 Difference]: Finished difference Result 570 states and 1198 transitions. [2025-03-03 14:33:43,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 14:33:43,782 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 30 states have internal predecessors, (87), 24 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (35), 14 states have call predecessors, (35), 24 states have call successors, (35) Word has length 1318 [2025-03-03 14:33:43,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:43,785 INFO L225 Difference]: With dead ends: 570 [2025-03-03 14:33:43,785 INFO L226 Difference]: Without dead ends: 216 [2025-03-03 14:33:43,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2668 GetRequests, 2619 SyntacticMatches, 11 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=526, Invalid=1034, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 14:33:43,789 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 31 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:43,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 207 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:33:43,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-03 14:33:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2025-03-03 14:33:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 144 states have internal predecessors, (154), 42 states have call successors, (42), 32 states have call predecessors, (42), 18 states have return successors, (77), 33 states have call predecessors, (77), 42 states have call successors, (77) [2025-03-03 14:33:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 273 transitions. [2025-03-03 14:33:43,802 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 273 transitions. Word has length 1318 [2025-03-03 14:33:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:43,802 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 273 transitions. [2025-03-03 14:33:43,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 30 states have internal predecessors, (87), 24 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (35), 14 states have call predecessors, (35), 24 states have call successors, (35) [2025-03-03 14:33:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 273 transitions. [2025-03-03 14:33:43,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2025-03-03 14:33:43,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:43,810 INFO L218 NwaCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:43,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-03 14:33:44,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:44,011 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:44,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:44,012 INFO L85 PathProgramCache]: Analyzing trace with hash -686723943, now seen corresponding path program 19 times [2025-03-03 14:33:44,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:44,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924602583] [2025-03-03 14:33:44,012 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:33:44,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:44,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1209 statements into 1 equivalence classes. [2025-03-03 14:33:44,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1209 of 1209 statements. [2025-03-03 14:33:44,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:33:44,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 14:33:44,135 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 14:33:44,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1209 statements into 1 equivalence classes. [2025-03-03 14:33:44,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1209 of 1209 statements. [2025-03-03 14:33:44,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:33:44,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 14:33:44,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 14:33:44,346 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 14:33:44,346 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:33:44,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:33:44,349 INFO L422 BasicCegarLoop]: Path program histogram: [19, 1, 1, 1] [2025-03-03 14:33:44,468 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:33:44,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:33:44 BoogieIcfgContainer [2025-03-03 14:33:44,470 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:33:44,470 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:33:44,470 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:33:44,471 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:33:44,473 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:32:54" (3/4) ... [2025-03-03 14:33:44,473 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 14:33:44,569 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 676. [2025-03-03 14:33:44,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:33:44,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:33:44,773 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:33:44,775 INFO L158 Benchmark]: Toolchain (without parser) took 50912.46ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 112.7MB in the beginning and 767.6MB in the end (delta: -654.9MB). Peak memory consumption was 513.6MB. Max. memory is 16.1GB. [2025-03-03 14:33:44,775 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:33:44,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 128.89ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 102.2MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:33:44,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.74ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 101.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:33:44,776 INFO L158 Benchmark]: Boogie Preprocessor took 22.94ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 100.1MB in the end (delta: 999.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:33:44,776 INFO L158 Benchmark]: IcfgBuilder took 180.02ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 90.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:33:44,776 INFO L158 Benchmark]: TraceAbstraction took 50255.41ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 89.6MB in the beginning and 337.2MB in the end (delta: -247.6MB). Peak memory consumption was 453.3MB. Max. memory is 16.1GB. [2025-03-03 14:33:44,776 INFO L158 Benchmark]: Witness Printer took 302.81ms. Allocated memory is still 847.2MB. Free memory was 337.2MB in the beginning and 767.6MB in the end (delta: -430.4MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2025-03-03 14:33:44,777 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 128.89ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 102.2MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.74ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 101.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.94ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 100.1MB in the end (delta: 999.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 180.02ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 90.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 50255.41ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 89.6MB in the beginning and 337.2MB in the end (delta: -247.6MB). Peak memory consumption was 453.3MB. Max. memory is 16.1GB. * Witness Printer took 302.81ms. Allocated memory is still 847.2MB. Free memory was 337.2MB in the beginning and 767.6MB in the end (delta: -430.4MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 10; VAL [x=10] [L27] CALL, EXPR fibo(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L8] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L10] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=9, n=9] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=10, n=10] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [x=10] [L27] int result = fibo(x); [L28] COND TRUE result == 55 VAL [x=10] [L29] reach_error() VAL [x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.1s, OverallIterations: 22, TraceHistogramMax: 229, PathProgramHistogramMax: 19, EmptinessCheckTime: 0.1s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1033 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 924 mSDsluCounter, 1996 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1576 mSDsCounter, 1166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2713 IncrementalHoareTripleChecker+Invalid, 3879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1166 mSolverCounterUnsat, 420 mSDtfsCounter, 2713 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20964 GetRequests, 20389 SyntacticMatches, 118 SemanticMatches, 457 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3361 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=19, InterpolantAutomatonStates: 266, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 365 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 38.5s InterpolantComputationTime, 21792 NumberOfCodeBlocks, 12534 NumberOfCodeBlocksAsserted, 521 NumberOfCheckSat, 30805 ConstructedInterpolants, 0 QuantifiedInterpolants, 36955 SizeOfPredicates, 89 NumberOfNonLiveVariables, 12589 ConjunctsInSsa, 254 ConjunctsInUnsatCore, 59 InterpolantComputations, 2 PerfectInterpolantSequences, 1826337/1920240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-03 14:33:44,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE