./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Fibonacci04-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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/Fibonacci04-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4783e070fd2491b45504d9f6f3060ee7c5288027d9d113e851641208eae29b1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:27:29,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:27:29,141 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:27:29,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:27:29,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:27:29,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:27:29,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:27:29,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:27:29,169 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:27:29,169 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:27:29,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:27:29,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:27:29,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:27:29,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:27:29,171 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:27:29,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:27:29,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:27:29,171 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:27:29,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:27:29,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:27:29,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:27:29,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:27:29,171 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:27:29,171 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:27:29,171 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:27:29,171 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:27:29,171 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:27:29,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:27:29,171 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:27:29,171 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:27:29,171 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:27:29,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:27:29,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:27:29,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:27:29,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:27:29,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:27:29,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:27:29,172 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:27:29,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:27:29,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:27:29,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:27:29,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:27:29,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:27:29,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:27:29,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:27:29,172 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 ! overflow) ) 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 -> a4783e070fd2491b45504d9f6f3060ee7c5288027d9d113e851641208eae29b1 [2025-03-04 11:27:29,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:27:29,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:27:29,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:27:29,421 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:27:29,421 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:27:29,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci04-overflow.c [2025-03-04 11:27:30,600 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9044e93c/c17408de6bf1433db1516b10cb4aecc7/FLAGe2cb9a379 [2025-03-04 11:27:30,790 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:27:30,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04-overflow.c [2025-03-04 11:27:30,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9044e93c/c17408de6bf1433db1516b10cb4aecc7/FLAGe2cb9a379 [2025-03-04 11:27:30,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9044e93c/c17408de6bf1433db1516b10cb4aecc7 [2025-03-04 11:27:30,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:27:30,826 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:27:30,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:27:30,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:27:30,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:27:30,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:27:30" (1/1) ... [2025-03-04 11:27:30,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@717db221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:30, skipping insertion in model container [2025-03-04 11:27:30,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:27:30" (1/1) ... [2025-03-04 11:27:30,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:27:30,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:27:30,961 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:27:30,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:27:30,984 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:27:30,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:30 WrapperNode [2025-03-04 11:27:30,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:27:30,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:27:30,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:27:30,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:27:30,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:30" (1/1) ... [2025-03-04 11:27:30,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:30" (1/1) ... [2025-03-04 11:27:31,006 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 24 [2025-03-04 11:27:31,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:27:31,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:27:31,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:27:31,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:27:31,013 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:30" (1/1) ... [2025-03-04 11:27:31,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:30" (1/1) ... [2025-03-04 11:27:31,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:30" (1/1) ... [2025-03-04 11:27:31,026 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-04 11:27:31,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:30" (1/1) ... [2025-03-04 11:27:31,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:30" (1/1) ... [2025-03-04 11:27:31,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:30" (1/1) ... [2025-03-04 11:27:31,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:30" (1/1) ... [2025-03-04 11:27:31,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:30" (1/1) ... [2025-03-04 11:27:31,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:30" (1/1) ... [2025-03-04 11:27:31,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:27:31,034 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:27:31,034 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:27:31,034 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:27:31,036 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:30" (1/1) ... [2025-03-04 11:27:31,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:27:31,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:31,065 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-04 11:27:31,067 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-04 11:27:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-03-04 11:27:31,085 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-03-04 11:27:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:27:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:27:31,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:27:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:27:31,128 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:27:31,130 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:27:31,216 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: havoc #t~ret4;havoc #t~ret5; [2025-03-04 11:27:31,242 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-04 11:27:31,242 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:27:31,250 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:27:31,251 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:27:31,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:27:31 BoogieIcfgContainer [2025-03-04 11:27:31,251 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:27:31,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:27:31,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:27:31,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:27:31,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:27:30" (1/3) ... [2025-03-04 11:27:31,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44306111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:27:31, skipping insertion in model container [2025-03-04 11:27:31,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:30" (2/3) ... [2025-03-04 11:27:31,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44306111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:27:31, skipping insertion in model container [2025-03-04 11:27:31,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:27:31" (3/3) ... [2025-03-04 11:27:31,260 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci04-overflow.c [2025-03-04 11:27:31,272 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:27:31,275 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci04-overflow.c that has 2 procedures, 31 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-04 11:27:31,321 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:27:31,329 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;@3f723b41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:27:31,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 11:27:31,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.45) internal successors, (29), 26 states have internal predecessors, (29), 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-04 11:27:31,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 11:27:31,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:31,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:31,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:31,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:31,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1001399972, now seen corresponding path program 1 times [2025-03-04 11:27:31,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:31,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063489166] [2025-03-04 11:27:31,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:31,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:31,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 11:27:31,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 11:27:31,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:31,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:31,483 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-04 11:27:31,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:31,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063489166] [2025-03-04 11:27:31,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063489166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:27:31,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:27:31,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:27:31,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357826166] [2025-03-04 11:27:31,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:27:31,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:27:31,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:31,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:27:31,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:27:31,508 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.45) internal successors, (29), 26 states have internal predecessors, (29), 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 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:27:31,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:31,549 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2025-03-04 11:27:31,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:27:31,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 11:27:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:31,556 INFO L225 Difference]: With dead ends: 36 [2025-03-04 11:27:31,556 INFO L226 Difference]: Without dead ends: 24 [2025-03-04 11:27:31,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:27:31,562 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:31,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 40 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:27:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-04 11:27:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-04 11:27:31,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:27:31,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-04 11:27:31,594 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 7 [2025-03-04 11:27:31,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:31,595 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-04 11:27:31,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:27:31,595 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-04 11:27:31,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:27:31,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:31,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:31,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:27:31,597 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:31,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:31,598 INFO L85 PathProgramCache]: Analyzing trace with hash 978628045, now seen corresponding path program 1 times [2025-03-04 11:27:31,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:31,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923501552] [2025-03-04 11:27:31,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:31,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:31,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:27:31,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:27:31,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:31,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:31,679 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-04 11:27:31,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:31,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923501552] [2025-03-04 11:27:31,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923501552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:27:31,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:27:31,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:27:31,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418867482] [2025-03-04 11:27:31,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:27:31,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:27:31,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:31,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:27:31,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:27:31,682 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:27:31,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:31,743 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-03-04 11:27:31,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:27:31,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 11:27:31,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:31,744 INFO L225 Difference]: With dead ends: 24 [2025-03-04 11:27:31,744 INFO L226 Difference]: Without dead ends: 22 [2025-03-04 11:27:31,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:27:31,745 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:31,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:27:31,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-04 11:27:31,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-03-04 11:27:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:27:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-04 11:27:31,753 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 8 [2025-03-04 11:27:31,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:31,753 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-04 11:27:31,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:27:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-04 11:27:31,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 11:27:31,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:31,754 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:31,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:27:31,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:31,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:31,757 INFO L85 PathProgramCache]: Analyzing trace with hash -989645326, now seen corresponding path program 1 times [2025-03-04 11:27:31,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:31,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792664157] [2025-03-04 11:27:31,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:31,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:31,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:27:31,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:27:31,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:31,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:31,919 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 11:27:31,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:31,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792664157] [2025-03-04 11:27:31,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792664157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:27:31,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:27:31,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:27:31,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481566334] [2025-03-04 11:27:31,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:27:31,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:27:31,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:31,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:27:31,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:27:31,921 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:27:31,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:31,959 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2025-03-04 11:27:31,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:27:31,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-04 11:27:31,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:31,960 INFO L225 Difference]: With dead ends: 34 [2025-03-04 11:27:31,960 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 11:27:31,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:27:31,961 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:31,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 52 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:27:31,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 11:27:31,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-03-04 11:27:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:27:31,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-04 11:27:31,969 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 29 [2025-03-04 11:27:31,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:31,970 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-04 11:27:31,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:27:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-03-04 11:27:31,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:27:31,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:31,971 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:31,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:27:31,972 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:31,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:31,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1650141125, now seen corresponding path program 1 times [2025-03-04 11:27:31,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:31,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850697820] [2025-03-04 11:27:31,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:31,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:31,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:27:31,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:27:31,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:31,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:27:32,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:32,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850697820] [2025-03-04 11:27:32,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850697820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:32,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751939729] [2025-03-04 11:27:32,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:32,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:32,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:32,112 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-04 11:27:32,114 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-04 11:27:32,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:27:32,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:27:32,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:32,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:32,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:27:32,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 11:27:32,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:32,393 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 11:27:32,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751939729] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:32,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:32,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-04 11:27:32,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822890954] [2025-03-04 11:27:32,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:32,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:27:32,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:32,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:27:32,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:27:32,394 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:27:32,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:32,633 INFO L93 Difference]: Finished difference Result 90 states and 128 transitions. [2025-03-04 11:27:32,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:27:32,633 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2025-03-04 11:27:32,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:32,634 INFO L225 Difference]: With dead ends: 90 [2025-03-04 11:27:32,634 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 11:27:32,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:27:32,636 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 102 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:32,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 94 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:27:32,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 11:27:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2025-03-04 11:27:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.105263157894737) internal successors, (42), 41 states have internal predecessors, (42), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 11:27:32,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2025-03-04 11:27:32,651 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 24 [2025-03-04 11:27:32,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:32,651 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2025-03-04 11:27:32,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:27:32,651 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2025-03-04 11:27:32,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:27:32,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:32,652 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:32,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 11:27:32,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:32,853 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:32,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:32,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1771203833, now seen corresponding path program 2 times [2025-03-04 11:27:32,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:32,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100435867] [2025-03-04 11:27:32,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:27:32,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:32,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 11:27:32,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:27:32,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:27:32,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:27:32,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:32,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100435867] [2025-03-04 11:27:32,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100435867] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:32,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568457216] [2025-03-04 11:27:32,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:27:32,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:32,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:32,944 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-04 11:27:32,946 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-04 11:27:32,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 11:27:32,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:27:32,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:27:32,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:32,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:27:32,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:27:33,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:27:33,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568457216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:27:33,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:27:33,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-04 11:27:33,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347968371] [2025-03-04 11:27:33,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:27:33,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:27:33,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:33,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:27:33,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:27:33,020 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:27:33,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:33,047 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2025-03-04 11:27:33,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:27:33,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-03-04 11:27:33,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:33,048 INFO L225 Difference]: With dead ends: 59 [2025-03-04 11:27:33,048 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 11:27:33,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:27:33,049 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:33,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 61 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:27:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 11:27:33,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-03-04 11:27:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.1) internal successors, (44), 42 states have internal predecessors, (44), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 11:27:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2025-03-04 11:27:33,056 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 24 [2025-03-04 11:27:33,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:33,056 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2025-03-04 11:27:33,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:27:33,056 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2025-03-04 11:27:33,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:27:33,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:33,057 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:33,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 11:27:33,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:33,261 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:33,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:33,262 INFO L85 PathProgramCache]: Analyzing trace with hash 927255998, now seen corresponding path program 1 times [2025-03-04 11:27:33,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:33,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388583007] [2025-03-04 11:27:33,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:33,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:33,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:27:33,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:27:33,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:33,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:27:33,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:33,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388583007] [2025-03-04 11:27:33,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388583007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:33,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531365667] [2025-03-04 11:27:33,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:33,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:33,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:33,337 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-04 11:27:33,349 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-04 11:27:33,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:27:33,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:27:33,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:33,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:33,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:27:33,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:33,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:27:33,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:27:33,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531365667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:27:33,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:27:33,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 11:27:33,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427918039] [2025-03-04 11:27:33,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:27:33,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:27:33,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:33,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:27:33,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:27:33,432 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:27:33,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:33,464 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2025-03-04 11:27:33,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:27:33,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-03-04 11:27:33,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:33,465 INFO L225 Difference]: With dead ends: 81 [2025-03-04 11:27:33,465 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 11:27:33,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:27:33,467 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:33,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 67 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:27:33,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 11:27:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2025-03-04 11:27:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 49 states have internal predecessors, (51), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (27), 11 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-04 11:27:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2025-03-04 11:27:33,482 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 25 [2025-03-04 11:27:33,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:33,482 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2025-03-04 11:27:33,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:27:33,482 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2025-03-04 11:27:33,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 11:27:33,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:33,485 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:33,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:27:33,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:33,686 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:33,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:33,686 INFO L85 PathProgramCache]: Analyzing trace with hash -72861698, now seen corresponding path program 1 times [2025-03-04 11:27:33,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:33,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819204486] [2025-03-04 11:27:33,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:33,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:33,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 11:27:33,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 11:27:33,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:33,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:33,839 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 11:27:33,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:33,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819204486] [2025-03-04 11:27:33,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819204486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:33,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098050925] [2025-03-04 11:27:33,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:33,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:33,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:33,843 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-04 11:27:33,844 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-04 11:27:33,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 11:27:33,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 11:27:33,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:33,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:33,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:27:33,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-04 11:27:33,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 11:27:34,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098050925] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:34,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:34,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-03-04 11:27:34,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798552790] [2025-03-04 11:27:34,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:34,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 11:27:34,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:34,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 11:27:34,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:27:34,107 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:27:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:34,292 INFO L93 Difference]: Finished difference Result 140 states and 216 transitions. [2025-03-04 11:27:34,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 11:27:34,295 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) Word has length 51 [2025-03-04 11:27:34,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:34,297 INFO L225 Difference]: With dead ends: 140 [2025-03-04 11:27:34,298 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 11:27:34,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:27:34,299 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:34,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 171 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:27:34,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 11:27:34,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 97. [2025-03-04 11:27:34,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.08) internal successors, (81), 74 states have internal predecessors, (81), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2025-03-04 11:27:34,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 158 transitions. [2025-03-04 11:27:34,318 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 158 transitions. Word has length 51 [2025-03-04 11:27:34,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:34,318 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 158 transitions. [2025-03-04 11:27:34,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:27:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 158 transitions. [2025-03-04 11:27:34,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 11:27:34,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:34,321 INFO L218 NwaCegarLoop]: trace histogram [10, 8, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 11:27:34,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 11:27:34,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:34,522 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:34,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:34,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1747983614, now seen corresponding path program 1 times [2025-03-04 11:27:34,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:34,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106655576] [2025-03-04 11:27:34,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:34,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:34,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 11:27:34,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 11:27:34,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:34,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 50 proven. 80 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-04 11:27:34,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:34,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106655576] [2025-03-04 11:27:34,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106655576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:34,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628244200] [2025-03-04 11:27:34,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:34,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:34,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:34,684 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-04 11:27:34,684 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-04 11:27:34,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 11:27:34,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 11:27:34,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:34,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:34,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:27:34,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:34,834 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 67 proven. 84 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-04 11:27:34,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:35,119 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 67 proven. 87 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-04 11:27:35,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628244200] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:35,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:35,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 16 [2025-03-04 11:27:35,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930402864] [2025-03-04 11:27:35,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:35,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 11:27:35,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:35,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 11:27:35,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:27:35,121 INFO L87 Difference]: Start difference. First operand 97 states and 158 transitions. Second operand has 16 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 10 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-04 11:27:35,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:35,267 INFO L93 Difference]: Finished difference Result 173 states and 298 transitions. [2025-03-04 11:27:35,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:27:35,268 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 10 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) Word has length 87 [2025-03-04 11:27:35,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:35,269 INFO L225 Difference]: With dead ends: 173 [2025-03-04 11:27:35,269 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 11:27:35,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 167 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:27:35,272 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 91 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:35,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 64 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:27:35,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 11:27:35,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2025-03-04 11:27:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 52 states have internal predecessors, (60), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (26), 12 states have call predecessors, (26), 6 states have call successors, (26) [2025-03-04 11:27:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2025-03-04 11:27:35,279 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 87 [2025-03-04 11:27:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:35,283 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2025-03-04 11:27:35,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 10 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-04 11:27:35,283 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2025-03-04 11:27:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 11:27:35,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:35,287 INFO L218 NwaCegarLoop]: trace histogram [19, 17, 14, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 1, 1, 1, 1] [2025-03-04 11:27:35,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 11:27:35,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:35,491 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:35,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:35,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2035860037, now seen corresponding path program 2 times [2025-03-04 11:27:35,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:35,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022529127] [2025-03-04 11:27:35,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:27:35,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:35,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 175 statements into 2 equivalence classes. [2025-03-04 11:27:35,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 11:27:35,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:27:35,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 93 proven. 424 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2025-03-04 11:27:35,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:35,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022529127] [2025-03-04 11:27:35,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022529127] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:35,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467791691] [2025-03-04 11:27:35,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:27:35,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:35,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:35,829 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-04 11:27:35,831 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-04 11:27:35,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 175 statements into 2 equivalence classes. [2025-03-04 11:27:35,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 11:27:35,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:27:35,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:35,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:27:35,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 606 proven. 183 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-04 11:27:36,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 109 proven. 495 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2025-03-04 11:27:36,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467791691] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:36,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:36,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 19 [2025-03-04 11:27:36,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914610909] [2025-03-04 11:27:36,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:36,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 11:27:36,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:36,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 11:27:36,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:27:36,544 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 14 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) [2025-03-04 11:27:36,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:36,764 INFO L93 Difference]: Finished difference Result 172 states and 253 transitions. [2025-03-04 11:27:36,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:27:36,765 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 14 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) Word has length 175 [2025-03-04 11:27:36,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:36,767 INFO L225 Difference]: With dead ends: 172 [2025-03-04 11:27:36,767 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 11:27:36,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 341 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:27:36,770 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 110 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:36,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 87 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:27:36,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 11:27:36,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2025-03-04 11:27:36,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 72 states have internal predecessors, (83), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (36), 15 states have call predecessors, (36), 9 states have call successors, (36) [2025-03-04 11:27:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions. [2025-03-04 11:27:36,789 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 129 transitions. Word has length 175 [2025-03-04 11:27:36,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:36,790 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 129 transitions. [2025-03-04 11:27:36,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 14 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) [2025-03-04 11:27:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2025-03-04 11:27:36,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 11:27:36,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:36,791 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1] [2025-03-04 11:27:36,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 11:27:36,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:36,992 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:36,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:36,993 INFO L85 PathProgramCache]: Analyzing trace with hash 585303526, now seen corresponding path program 3 times [2025-03-04 11:27:36,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:36,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371286697] [2025-03-04 11:27:36,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:27:36,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:36,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 83 statements into 8 equivalence classes. [2025-03-04 11:27:37,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 50 of 83 statements. [2025-03-04 11:27:37,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 11:27:37,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 58 proven. 8 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-04 11:27:37,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:37,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371286697] [2025-03-04 11:27:37,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371286697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:37,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550895413] [2025-03-04 11:27:37,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:27:37,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:37,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:37,122 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-04 11:27:37,124 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-04 11:27:37,150 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 83 statements into 8 equivalence classes. [2025-03-04 11:27:37,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 50 of 83 statements. [2025-03-04 11:27:37,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 11:27:37,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:37,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:27:37,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:37,232 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-04 11:27:37,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-04 11:27:37,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550895413] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:37,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:37,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-03-04 11:27:37,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203721561] [2025-03-04 11:27:37,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:37,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 11:27:37,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:37,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 11:27:37,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:27:37,403 INFO L87 Difference]: Start difference. First operand 94 states and 129 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 11:27:37,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:37,479 INFO L93 Difference]: Finished difference Result 100 states and 136 transitions. [2025-03-04 11:27:37,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:27:37,480 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) Word has length 83 [2025-03-04 11:27:37,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:37,481 INFO L225 Difference]: With dead ends: 100 [2025-03-04 11:27:37,481 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 11:27:37,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 154 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:27:37,482 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:37,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 161 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:27:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 11:27:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2025-03-04 11:27:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 71 states have internal predecessors, (81), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (36), 15 states have call predecessors, (36), 9 states have call successors, (36) [2025-03-04 11:27:37,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 127 transitions. [2025-03-04 11:27:37,502 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 127 transitions. Word has length 83 [2025-03-04 11:27:37,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:37,503 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 127 transitions. [2025-03-04 11:27:37,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 11:27:37,503 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 127 transitions. [2025-03-04 11:27:37,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 11:27:37,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:37,504 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1] [2025-03-04 11:27:37,512 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-04 11:27:37,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:37,706 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:37,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:37,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1318170883, now seen corresponding path program 2 times [2025-03-04 11:27:37,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:37,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689741734] [2025-03-04 11:27:37,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:27:37,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:37,717 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-03-04 11:27:37,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 11:27:37,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:27:37,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-04 11:27:37,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:37,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689741734] [2025-03-04 11:27:37,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689741734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:27:37,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:27:37,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:27:37,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71305415] [2025-03-04 11:27:37,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:27:37,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:27:37,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:37,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:27:37,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:27:37,803 INFO L87 Difference]: Start difference. First operand 93 states and 127 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:27:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:37,819 INFO L93 Difference]: Finished difference Result 100 states and 134 transitions. [2025-03-04 11:27:37,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:27:37,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 84 [2025-03-04 11:27:37,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:37,822 INFO L225 Difference]: With dead ends: 100 [2025-03-04 11:27:37,822 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 11:27:37,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:27:37,823 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:37,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 64 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:27:37,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 11:27:37,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2025-03-04 11:27:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 71 states have internal predecessors, (81), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (36), 15 states have call predecessors, (36), 9 states have call successors, (36) [2025-03-04 11:27:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 127 transitions. [2025-03-04 11:27:37,835 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 127 transitions. Word has length 84 [2025-03-04 11:27:37,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:37,835 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 127 transitions. [2025-03-04 11:27:37,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:27:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 127 transitions. [2025-03-04 11:27:37,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 11:27:37,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:37,836 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 8, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2025-03-04 11:27:37,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 11:27:37,837 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:37,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:37,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1623830502, now seen corresponding path program 3 times [2025-03-04 11:27:37,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:37,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028953285] [2025-03-04 11:27:37,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:27:37,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:37,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 8 equivalence classes. [2025-03-04 11:27:37,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 79 of 91 statements. [2025-03-04 11:27:37,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 11:27:37,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 102 proven. 38 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-04 11:27:37,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:37,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028953285] [2025-03-04 11:27:37,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028953285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:37,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924614166] [2025-03-04 11:27:37,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:27:37,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:37,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:37,927 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-04 11:27:37,928 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-04 11:27:37,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 8 equivalence classes. [2025-03-04 11:27:37,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 79 of 91 statements. [2025-03-04 11:27:37,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 11:27:37,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:37,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 11:27:37,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:38,135 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 11:27:38,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 20 proven. 66 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 11:27:38,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924614166] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:38,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:38,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 30 [2025-03-04 11:27:38,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598725888] [2025-03-04 11:27:38,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:38,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 11:27:38,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:38,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 11:27:38,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:27:38,736 INFO L87 Difference]: Start difference. First operand 93 states and 127 transitions. Second operand has 30 states, 30 states have (on average 3.3) internal successors, (99), 30 states have internal predecessors, (99), 10 states have call successors, (13), 1 states have call predecessors, (13), 12 states have return successors, (22), 19 states have call predecessors, (22), 10 states have call successors, (22) [2025-03-04 11:27:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:40,219 INFO L93 Difference]: Finished difference Result 455 states and 907 transitions. [2025-03-04 11:27:40,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-04 11:27:40,220 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.3) internal successors, (99), 30 states have internal predecessors, (99), 10 states have call successors, (13), 1 states have call predecessors, (13), 12 states have return successors, (22), 19 states have call predecessors, (22), 10 states have call successors, (22) Word has length 91 [2025-03-04 11:27:40,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:40,223 INFO L225 Difference]: With dead ends: 455 [2025-03-04 11:27:40,223 INFO L226 Difference]: Without dead ends: 365 [2025-03-04 11:27:40,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 160 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3134 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1674, Invalid=7832, Unknown=0, NotChecked=0, Total=9506 [2025-03-04 11:27:40,227 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 355 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:40,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 123 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:27:40,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-04 11:27:40,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 258. [2025-03-04 11:27:40,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 203 states have (on average 1.0394088669950738) internal successors, (211), 199 states have internal predecessors, (211), 28 states have call successors, (28), 6 states have call predecessors, (28), 26 states have return successors, (329), 52 states have call predecessors, (329), 27 states have call successors, (329) [2025-03-04 11:27:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 568 transitions. [2025-03-04 11:27:40,258 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 568 transitions. Word has length 91 [2025-03-04 11:27:40,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:40,259 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 568 transitions. [2025-03-04 11:27:40,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.3) internal successors, (99), 30 states have internal predecessors, (99), 10 states have call successors, (13), 1 states have call predecessors, (13), 12 states have return successors, (22), 19 states have call predecessors, (22), 10 states have call successors, (22) [2025-03-04 11:27:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 568 transitions. [2025-03-04 11:27:40,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-03-04 11:27:40,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:40,263 INFO L218 NwaCegarLoop]: trace histogram [40, 38, 29, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 18, 11, 9, 1, 1, 1, 1] [2025-03-04 11:27:40,268 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-04 11:27:40,463 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,SelfDestructingSolverStorable11 [2025-03-04 11:27:40,464 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:40,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:40,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2124993246, now seen corresponding path program 4 times [2025-03-04 11:27:40,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:40,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104064367] [2025-03-04 11:27:40,466 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:27:40,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:40,478 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 381 statements into 2 equivalence classes. [2025-03-04 11:27:40,491 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 225 of 381 statements. [2025-03-04 11:27:40,494 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:27:40,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:40,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5139 backedges. 133 proven. 760 refuted. 0 times theorem prover too weak. 4246 trivial. 0 not checked. [2025-03-04 11:27:40,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:40,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104064367] [2025-03-04 11:27:40,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104064367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:40,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960650819] [2025-03-04 11:27:40,649 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:27:40,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:40,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:40,651 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-04 11:27:40,653 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-04 11:27:40,698 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 381 statements into 2 equivalence classes. [2025-03-04 11:27:40,731 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 225 of 381 statements. [2025-03-04 11:27:40,732 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:27:40,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:40,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:27:40,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5139 backedges. 1376 proven. 15 refuted. 0 times theorem prover too weak. 3748 trivial. 0 not checked. [2025-03-04 11:27:40,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5139 backedges. 138 proven. 885 refuted. 0 times theorem prover too weak. 4116 trivial. 0 not checked. [2025-03-04 11:27:41,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960650819] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:41,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:41,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14 [2025-03-04 11:27:41,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780017995] [2025-03-04 11:27:41,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:41,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 11:27:41,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:41,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 11:27:41,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:27:41,311 INFO L87 Difference]: Start difference. First operand 258 states and 568 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 11:27:41,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:41,395 INFO L93 Difference]: Finished difference Result 356 states and 849 transitions. [2025-03-04 11:27:41,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:27:41,396 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) Word has length 381 [2025-03-04 11:27:41,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:41,397 INFO L225 Difference]: With dead ends: 356 [2025-03-04 11:27:41,398 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 11:27:41,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 774 GetRequests, 754 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:27:41,402 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:41,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 58 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:27:41,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 11:27:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2025-03-04 11:27:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 75 states have internal predecessors, (80), 11 states have call successors, (11), 5 states have call predecessors, (11), 9 states have return successors, (47), 16 states have call predecessors, (47), 10 states have call successors, (47) [2025-03-04 11:27:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2025-03-04 11:27:41,421 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 381 [2025-03-04 11:27:41,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:41,421 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2025-03-04 11:27:41,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 11:27:41,421 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2025-03-04 11:27:41,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-04 11:27:41,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:41,426 INFO L218 NwaCegarLoop]: trace histogram [39, 38, 31, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 12, 8, 1, 1, 1, 1] [2025-03-04 11:27:41,432 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-04 11:27:41,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 11:27:41,627 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:41,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:41,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1062925625, now seen corresponding path program 5 times [2025-03-04 11:27:41,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:41,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702686955] [2025-03-04 11:27:41,627 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:27:41,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:41,638 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 378 statements into 27 equivalence classes. [2025-03-04 11:27:41,653 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 219 of 378 statements. [2025-03-04 11:27:41,653 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-04 11:27:41,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5063 backedges. 976 proven. 788 refuted. 0 times theorem prover too weak. 3299 trivial. 0 not checked. [2025-03-04 11:27:41,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:41,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702686955] [2025-03-04 11:27:41,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702686955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:41,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204712877] [2025-03-04 11:27:41,879 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:27:41,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:41,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:41,881 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-04 11:27:41,883 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-04 11:27:41,928 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 378 statements into 27 equivalence classes. [2025-03-04 11:27:41,966 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 219 of 378 statements. [2025-03-04 11:27:41,966 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-04 11:27:41,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:41,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 11:27:41,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5063 backedges. 980 proven. 782 refuted. 0 times theorem prover too weak. 3301 trivial. 0 not checked. [2025-03-04 11:27:42,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5063 backedges. 978 proven. 800 refuted. 0 times theorem prover too weak. 3285 trivial. 0 not checked. [2025-03-04 11:27:43,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204712877] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:43,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:43,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 16] total 22 [2025-03-04 11:27:43,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472012698] [2025-03-04 11:27:43,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:43,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 11:27:43,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:43,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 11:27:43,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:27:43,053 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 22 states, 22 states have (on average 5.090909090909091) internal successors, (112), 22 states have internal predecessors, (112), 13 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) [2025-03-04 11:27:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:43,306 INFO L93 Difference]: Finished difference Result 217 states and 334 transitions. [2025-03-04 11:27:43,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 11:27:43,306 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.090909090909091) internal successors, (112), 22 states have internal predecessors, (112), 13 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) Word has length 378 [2025-03-04 11:27:43,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:43,308 INFO L225 Difference]: With dead ends: 217 [2025-03-04 11:27:43,308 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 11:27:43,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 787 GetRequests, 746 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=368, Invalid=892, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 11:27:43,310 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 141 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:43,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 98 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:27:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 11:27:43,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 109. [2025-03-04 11:27:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 84 states have internal predecessors, (91), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (44), 16 states have call predecessors, (44), 11 states have call successors, (44) [2025-03-04 11:27:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2025-03-04 11:27:43,317 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 378 [2025-03-04 11:27:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:43,317 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2025-03-04 11:27:43,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.090909090909091) internal successors, (112), 22 states have internal predecessors, (112), 13 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) [2025-03-04 11:27:43,318 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2025-03-04 11:27:43,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-04 11:27:43,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:43,319 INFO L218 NwaCegarLoop]: trace histogram [28, 26, 22, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 8, 6, 1, 1, 1, 1] [2025-03-04 11:27:43,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:27:43,523 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,SelfDestructingSolverStorable13 [2025-03-04 11:27:43,523 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:43,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:43,527 INFO L85 PathProgramCache]: Analyzing trace with hash -177203273, now seen corresponding path program 6 times [2025-03-04 11:27:43,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:43,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745162087] [2025-03-04 11:27:43,527 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:27:43,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:43,535 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 266 statements into 16 equivalence classes. [2025-03-04 11:27:43,553 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 210 of 266 statements. [2025-03-04 11:27:43,556 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-03-04 11:27:43,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2456 backedges. 278 proven. 642 refuted. 0 times theorem prover too weak. 1536 trivial. 0 not checked. [2025-03-04 11:27:43,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:43,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745162087] [2025-03-04 11:27:43,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745162087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:43,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892152477] [2025-03-04 11:27:43,679 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:27:43,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:43,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:43,682 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-04 11:27:43,683 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-04 11:27:43,724 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 266 statements into 16 equivalence classes. [2025-03-04 11:27:43,759 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 210 of 266 statements. [2025-03-04 11:27:43,760 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-03-04 11:27:43,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:43,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:27:43,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:43,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2456 backedges. 1460 proven. 135 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-04 11:27:43,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2456 backedges. 282 proven. 646 refuted. 0 times theorem prover too weak. 1528 trivial. 0 not checked. [2025-03-04 11:27:44,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892152477] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:44,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:44,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 15 [2025-03-04 11:27:44,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746025041] [2025-03-04 11:27:44,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:44,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:27:44,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:44,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:27:44,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:27:44,377 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 9 states have call successors, (17), 2 states have call predecessors, (17), 7 states have return successors, (19), 10 states have call predecessors, (19), 9 states have call successors, (19) [2025-03-04 11:27:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:44,508 INFO L93 Difference]: Finished difference Result 226 states and 322 transitions. [2025-03-04 11:27:44,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:27:44,509 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 9 states have call successors, (17), 2 states have call predecessors, (17), 7 states have return successors, (19), 10 states have call predecessors, (19), 9 states have call successors, (19) Word has length 266 [2025-03-04 11:27:44,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:44,510 INFO L225 Difference]: With dead ends: 226 [2025-03-04 11:27:44,510 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 11:27:44,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 525 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:27:44,511 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 51 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:44,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 126 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:27:44,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 11:27:44,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2025-03-04 11:27:44,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.051948051948052) internal successors, (81), 76 states have internal predecessors, (81), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (26), 12 states have call predecessors, (26), 11 states have call successors, (26) [2025-03-04 11:27:44,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2025-03-04 11:27:44,517 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 266 [2025-03-04 11:27:44,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:44,518 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2025-03-04 11:27:44,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 9 states have call successors, (17), 2 states have call predecessors, (17), 7 states have return successors, (19), 10 states have call predecessors, (19), 9 states have call successors, (19) [2025-03-04 11:27:44,518 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2025-03-04 11:27:44,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-03-04 11:27:44,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:44,519 INFO L218 NwaCegarLoop]: trace histogram [47, 45, 38, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 21, 15, 9, 1, 1, 1, 1] [2025-03-04 11:27:44,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 11:27:44,720 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,SelfDestructingSolverStorable14 [2025-03-04 11:27:44,720 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:44,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:44,721 INFO L85 PathProgramCache]: Analyzing trace with hash -237754126, now seen corresponding path program 7 times [2025-03-04 11:27:44,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:44,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850439814] [2025-03-04 11:27:44,721 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 11:27:44,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:44,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-04 11:27:44,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-04 11:27:44,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:44,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7309 backedges. 558 proven. 2001 refuted. 0 times theorem prover too weak. 4750 trivial. 0 not checked. [2025-03-04 11:27:45,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:45,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850439814] [2025-03-04 11:27:45,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850439814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:45,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597586327] [2025-03-04 11:27:45,191 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 11:27:45,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:45,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:45,193 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-04 11:27:45,195 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-04 11:27:45,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-04 11:27:45,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-04 11:27:45,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:45,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:45,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 11:27:45,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7309 backedges. 3859 proven. 1245 refuted. 0 times theorem prover too weak. 2205 trivial. 0 not checked. [2025-03-04 11:27:45,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:46,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7309 backedges. 658 proven. 2493 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2025-03-04 11:27:46,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597586327] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:46,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:46,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 22] total 27 [2025-03-04 11:27:46,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249230104] [2025-03-04 11:27:46,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:46,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 11:27:46,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:46,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 11:27:46,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:27:46,567 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 27 states, 27 states have (on average 6.0) internal successors, (162), 27 states have internal predecessors, (162), 22 states have call successors, (29), 3 states have call predecessors, (29), 11 states have return successors, (34), 13 states have call predecessors, (34), 21 states have call successors, (34) [2025-03-04 11:27:46,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:46,886 INFO L93 Difference]: Finished difference Result 232 states and 307 transitions. [2025-03-04 11:27:46,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 11:27:46,886 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.0) internal successors, (162), 27 states have internal predecessors, (162), 22 states have call successors, (29), 3 states have call predecessors, (29), 11 states have return successors, (34), 13 states have call predecessors, (34), 21 states have call successors, (34) Word has length 452 [2025-03-04 11:27:46,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:46,887 INFO L225 Difference]: With dead ends: 232 [2025-03-04 11:27:46,887 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 11:27:46,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 947 GetRequests, 889 SyntacticMatches, 12 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=589, Invalid=1667, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 11:27:46,889 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 227 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:46,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 131 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:27:46,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 11:27:46,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 118. [2025-03-04 11:27:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.063157894736842) internal successors, (101), 92 states have internal predecessors, (101), 14 states have call successors, (14), 10 states have call predecessors, (14), 8 states have return successors, (32), 15 states have call predecessors, (32), 13 states have call successors, (32) [2025-03-04 11:27:46,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2025-03-04 11:27:46,897 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 452 [2025-03-04 11:27:46,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:46,898 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2025-03-04 11:27:46,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.0) internal successors, (162), 27 states have internal predecessors, (162), 22 states have call successors, (29), 3 states have call predecessors, (29), 11 states have return successors, (34), 13 states have call predecessors, (34), 21 states have call successors, (34) [2025-03-04 11:27:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2025-03-04 11:27:46,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-04 11:27:46,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:46,899 INFO L218 NwaCegarLoop]: trace histogram [31, 30, 25, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 10, 6, 1, 1, 1, 1] [2025-03-04 11:27:46,906 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-04 11:27:47,099 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,SelfDestructingSolverStorable15 [2025-03-04 11:27:47,100 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:47,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:47,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1833267971, now seen corresponding path program 8 times [2025-03-04 11:27:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:47,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436336217] [2025-03-04 11:27:47,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:27:47,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:47,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 300 statements into 2 equivalence classes. [2025-03-04 11:27:47,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 300 of 300 statements. [2025-03-04 11:27:47,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:27:47,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:47,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 522 proven. 990 refuted. 0 times theorem prover too weak. 1638 trivial. 0 not checked. [2025-03-04 11:27:47,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:47,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436336217] [2025-03-04 11:27:47,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436336217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:47,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536265059] [2025-03-04 11:27:47,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:27:47,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:47,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:47,361 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-04 11:27:47,363 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-04 11:27:47,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 300 statements into 2 equivalence classes. [2025-03-04 11:27:47,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 300 of 300 statements. [2025-03-04 11:27:47,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:27:47,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:47,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 11:27:47,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 1787 proven. 484 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2025-03-04 11:27:47,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 517 proven. 1101 refuted. 0 times theorem prover too weak. 1532 trivial. 0 not checked. [2025-03-04 11:27:48,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536265059] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:48,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:48,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 19] total 24 [2025-03-04 11:27:48,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851842345] [2025-03-04 11:27:48,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:48,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:27:48,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:48,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:27:48,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:27:48,551 INFO L87 Difference]: Start difference. First operand 118 states and 147 transitions. Second operand has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 24 states have internal predecessors, (134), 18 states have call successors, (23), 2 states have call predecessors, (23), 10 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) [2025-03-04 11:27:48,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:48,821 INFO L93 Difference]: Finished difference Result 231 states and 299 transitions. [2025-03-04 11:27:48,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 11:27:48,821 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 24 states have internal predecessors, (134), 18 states have call successors, (23), 2 states have call predecessors, (23), 10 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) Word has length 300 [2025-03-04 11:27:48,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:48,822 INFO L225 Difference]: With dead ends: 231 [2025-03-04 11:27:48,822 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 11:27:48,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 587 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=349, Invalid=911, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 11:27:48,824 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 119 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:48,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 170 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:27:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 11:27:48,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2025-03-04 11:27:48,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.035294117647059) internal successors, (88), 83 states have internal predecessors, (88), 13 states have call successors, (13), 10 states have call predecessors, (13), 7 states have return successors, (26), 12 states have call predecessors, (26), 12 states have call successors, (26) [2025-03-04 11:27:48,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2025-03-04 11:27:48,832 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 300 [2025-03-04 11:27:48,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:48,832 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2025-03-04 11:27:48,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 24 states have internal predecessors, (134), 18 states have call successors, (23), 2 states have call predecessors, (23), 10 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) [2025-03-04 11:27:48,832 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2025-03-04 11:27:48,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2025-03-04 11:27:48,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:48,836 INFO L218 NwaCegarLoop]: trace histogram [80, 75, 65, 41, 41, 41, 41, 38, 38, 38, 38, 38, 37, 37, 37, 36, 24, 15, 1, 1, 1, 1] [2025-03-04 11:27:48,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 11:27:49,036 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,SelfDestructingSolverStorable16 [2025-03-04 11:27:49,037 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:49,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:49,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1672740584, now seen corresponding path program 9 times [2025-03-04 11:27:49,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:49,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228180304] [2025-03-04 11:27:49,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:27:49,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:49,052 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 764 statements into 60 equivalence classes. [2025-03-04 11:27:49,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) and asserted 502 of 764 statements. [2025-03-04 11:27:49,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2025-03-04 11:27:49,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 21220 backedges. 6070 proven. 2318 refuted. 0 times theorem prover too weak. 12832 trivial. 0 not checked. [2025-03-04 11:27:51,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:51,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228180304] [2025-03-04 11:27:51,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228180304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:51,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050704495] [2025-03-04 11:27:51,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:27:51,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:51,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:51,540 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-04 11:27:51,544 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-04 11:27:51,645 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 764 statements into 60 equivalence classes. [2025-03-04 11:27:51,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) and asserted 502 of 764 statements. [2025-03-04 11:27:51,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2025-03-04 11:27:51,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:51,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-03-04 11:27:51,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:52,160 INFO L134 CoverageAnalysis]: Checked inductivity of 21220 backedges. 6012 proven. 1736 refuted. 0 times theorem prover too weak. 13472 trivial. 0 not checked. [2025-03-04 11:27:52,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 21220 backedges. 6479 proven. 1574 refuted. 0 times theorem prover too weak. 13167 trivial. 0 not checked. [2025-03-04 11:27:59,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050704495] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:59,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:59,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 32] total 46 [2025-03-04 11:27:59,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257972553] [2025-03-04 11:27:59,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:59,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-04 11:27:59,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:59,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-04 11:27:59,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=1667, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 11:27:59,656 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand has 47 states, 46 states have (on average 2.8260869565217392) internal successors, (130), 47 states have internal predecessors, (130), 12 states have call successors, (14), 1 states have call predecessors, (14), 14 states have return successors, (34), 33 states have call predecessors, (34), 12 states have call successors, (34) [2025-03-04 11:27:59,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:59,864 INFO L93 Difference]: Finished difference Result 167 states and 239 transitions. [2025-03-04 11:27:59,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 11:27:59,864 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.8260869565217392) internal successors, (130), 47 states have internal predecessors, (130), 12 states have call successors, (14), 1 states have call predecessors, (14), 14 states have return successors, (34), 33 states have call predecessors, (34), 12 states have call successors, (34) Word has length 764 [2025-03-04 11:27:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:59,866 INFO L225 Difference]: With dead ends: 167 [2025-03-04 11:27:59,866 INFO L226 Difference]: Without dead ends: 166 [2025-03-04 11:27:59,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1635 GetRequests, 1514 SyntacticMatches, 68 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2945 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=663, Invalid=2307, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 11:27:59,867 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:59,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 143 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:27:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-04 11:27:59,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 142. [2025-03-04 11:27:59,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 113 states have (on average 1.0265486725663717) internal successors, (116), 111 states have internal predecessors, (116), 17 states have call successors, (17), 10 states have call predecessors, (17), 11 states have return successors, (70), 20 states have call predecessors, (70), 16 states have call successors, (70) [2025-03-04 11:27:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 203 transitions. [2025-03-04 11:27:59,878 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 203 transitions. Word has length 764 [2025-03-04 11:27:59,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:59,880 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 203 transitions. [2025-03-04 11:27:59,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.8260869565217392) internal successors, (130), 47 states have internal predecessors, (130), 12 states have call successors, (14), 1 states have call predecessors, (14), 14 states have return successors, (34), 33 states have call predecessors, (34), 12 states have call successors, (34) [2025-03-04 11:27:59,880 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 203 transitions. [2025-03-04 11:27:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1165 [2025-03-04 11:27:59,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:59,887 INFO L218 NwaCegarLoop]: trace histogram [120, 117, 97, 60, 60, 60, 60, 59, 59, 59, 59, 59, 58, 58, 58, 57, 37, 23, 1, 1, 1, 1] [2025-03-04 11:27:59,893 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-04 11:28:00,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:00,088 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:00,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:00,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1232664598, now seen corresponding path program 10 times [2025-03-04 11:28:00,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:00,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174121597] [2025-03-04 11:28:00,088 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:00,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:00,106 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1164 statements into 2 equivalence classes. [2025-03-04 11:28:00,139 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 691 of 1164 statements. [2025-03-04 11:28:00,139 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:28:00,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 49621 backedges. 1193 proven. 7557 refuted. 0 times theorem prover too weak. 40871 trivial. 0 not checked. [2025-03-04 11:28:00,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:00,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174121597] [2025-03-04 11:28:00,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174121597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:00,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970830879] [2025-03-04 11:28:00,670 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:00,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:00,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:00,672 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-04 11:28:00,673 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-04 11:28:00,842 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1164 statements into 2 equivalence classes. [2025-03-04 11:28:00,937 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 691 of 1164 statements. [2025-03-04 11:28:00,937 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:28:00,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:00,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 11:28:00,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:01,104 INFO L134 CoverageAnalysis]: Checked inductivity of 49621 backedges. 25802 proven. 2740 refuted. 0 times theorem prover too weak. 21079 trivial. 0 not checked. [2025-03-04 11:28:01,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 49621 backedges. 1428 proven. 9176 refuted. 0 times theorem prover too weak. 39017 trivial. 0 not checked. [2025-03-04 11:28:03,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970830879] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:03,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:03,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 25] total 30 [2025-03-04 11:28:03,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688520540] [2025-03-04 11:28:03,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:03,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 11:28:03,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:03,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 11:28:03,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:28:03,042 INFO L87 Difference]: Start difference. First operand 142 states and 203 transitions. Second operand has 30 states, 30 states have (on average 5.966666666666667) internal successors, (179), 30 states have internal predecessors, (179), 25 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (37), 14 states have call predecessors, (37), 23 states have call successors, (37) [2025-03-04 11:28:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:03,384 INFO L93 Difference]: Finished difference Result 352 states and 577 transitions. [2025-03-04 11:28:03,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 11:28:03,384 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.966666666666667) internal successors, (179), 30 states have internal predecessors, (179), 25 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (37), 14 states have call predecessors, (37), 23 states have call successors, (37) Word has length 1164 [2025-03-04 11:28:03,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:03,386 INFO L225 Difference]: With dead ends: 352 [2025-03-04 11:28:03,386 INFO L226 Difference]: Without dead ends: 215 [2025-03-04 11:28:03,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2380 GetRequests, 2311 SyntacticMatches, 15 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=2284, Unknown=0, NotChecked=0, Total=3080 [2025-03-04 11:28:03,390 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 279 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:03,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 151 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-04 11:28:03,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 193. [2025-03-04 11:28:03,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 155 states have (on average 1.032258064516129) internal successors, (160), 151 states have internal predecessors, (160), 23 states have call successors, (23), 14 states have call predecessors, (23), 14 states have return successors, (90), 27 states have call predecessors, (90), 22 states have call successors, (90) [2025-03-04 11:28:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 273 transitions. [2025-03-04 11:28:03,404 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 273 transitions. Word has length 1164 [2025-03-04 11:28:03,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:03,404 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 273 transitions. [2025-03-04 11:28:03,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.966666666666667) internal successors, (179), 30 states have internal predecessors, (179), 25 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (37), 14 states have call predecessors, (37), 23 states have call successors, (37) [2025-03-04 11:28:03,405 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 273 transitions. [2025-03-04 11:28:03,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 954 [2025-03-04 11:28:03,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:03,410 INFO L218 NwaCegarLoop]: trace histogram [98, 96, 79, 49, 49, 49, 49, 48, 48, 48, 48, 48, 48, 48, 48, 47, 30, 19, 1, 1, 1, 1] [2025-03-04 11:28:03,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 11:28:03,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:03,611 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:03,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:03,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1168037428, now seen corresponding path program 11 times [2025-03-04 11:28:03,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:03,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925026303] [2025-03-04 11:28:03,611 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:28:03,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:03,633 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 953 statements into 70 equivalence classes. [2025-03-04 11:28:03,702 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) and asserted 721 of 953 statements. [2025-03-04 11:28:03,702 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2025-03-04 11:28:03,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 33131 backedges. 4919 proven. 2369 refuted. 0 times theorem prover too weak. 25843 trivial. 0 not checked. [2025-03-04 11:28:04,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:04,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925026303] [2025-03-04 11:28:04,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925026303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:04,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20202439] [2025-03-04 11:28:04,187 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:28:04,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:04,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:04,189 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-04 11:28:04,190 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-04 11:28:04,365 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 953 statements into 70 equivalence classes. [2025-03-04 11:28:04,492 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) and asserted 721 of 953 statements. [2025-03-04 11:28:04,492 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2025-03-04 11:28:04,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:04,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 1334 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 11:28:04,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:04,607 INFO L134 CoverageAnalysis]: Checked inductivity of 33131 backedges. 14501 proven. 1171 refuted. 0 times theorem prover too weak. 17459 trivial. 0 not checked. [2025-03-04 11:28:04,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:07,092 INFO L134 CoverageAnalysis]: Checked inductivity of 33131 backedges. 5077 proven. 2577 refuted. 0 times theorem prover too weak. 25477 trivial. 0 not checked. [2025-03-04 11:28:07,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20202439] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:07,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:07,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 21] total 26 [2025-03-04 11:28:07,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216089753] [2025-03-04 11:28:07,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:07,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 11:28:07,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:07,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 11:28:07,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:28:07,094 INFO L87 Difference]: Start difference. First operand 193 states and 273 transitions. Second operand has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 26 states have internal predecessors, (149), 19 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (33), 13 states have call predecessors, (33), 19 states have call successors, (33) [2025-03-04 11:28:07,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:07,486 INFO L93 Difference]: Finished difference Result 357 states and 540 transitions. [2025-03-04 11:28:07,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 11:28:07,487 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 26 states have internal predecessors, (149), 19 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (33), 13 states have call predecessors, (33), 19 states have call successors, (33) Word has length 953 [2025-03-04 11:28:07,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:07,490 INFO L225 Difference]: With dead ends: 357 [2025-03-04 11:28:07,491 INFO L226 Difference]: Without dead ends: 169 [2025-03-04 11:28:07,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1943 GetRequests, 1892 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=487, Invalid=1319, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 11:28:07,493 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 119 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:07,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 216 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:07,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-04 11:28:07,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 145. [2025-03-04 11:28:07,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 116 states have (on average 1.0258620689655173) internal successors, (119), 114 states have internal predecessors, (119), 18 states have call successors, (18), 12 states have call predecessors, (18), 10 states have return successors, (55), 18 states have call predecessors, (55), 17 states have call successors, (55) [2025-03-04 11:28:07,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 192 transitions. [2025-03-04 11:28:07,503 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 192 transitions. Word has length 953 [2025-03-04 11:28:07,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:07,506 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 192 transitions. [2025-03-04 11:28:07,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 26 states have internal predecessors, (149), 19 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (33), 13 states have call predecessors, (33), 19 states have call successors, (33) [2025-03-04 11:28:07,506 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 192 transitions. [2025-03-04 11:28:07,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1242 [2025-03-04 11:28:07,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:07,514 INFO L218 NwaCegarLoop]: trace histogram [129, 123, 105, 66, 66, 66, 66, 62, 62, 62, 62, 62, 61, 61, 61, 60, 39, 24, 1, 1, 1, 1] [2025-03-04 11:28:07,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 11:28:07,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:07,715 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:07,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:07,716 INFO L85 PathProgramCache]: Analyzing trace with hash -350149315, now seen corresponding path program 12 times [2025-03-04 11:28:07,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:07,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209076474] [2025-03-04 11:28:07,716 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:28:07,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:07,733 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1241 statements into 91 equivalence classes. [2025-03-04 11:28:07,871 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 62 check-sat command(s) and asserted 832 of 1241 statements. [2025-03-04 11:28:07,871 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 62 check-sat command(s) [2025-03-04 11:28:07,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 56467 backedges. 4332 proven. 9219 refuted. 0 times theorem prover too weak. 42916 trivial. 0 not checked. [2025-03-04 11:28:09,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:09,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209076474] [2025-03-04 11:28:09,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209076474] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:09,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991074551] [2025-03-04 11:28:09,004 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:28:09,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:09,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:09,005 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-04 11:28:09,006 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-04 11:28:09,220 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1241 statements into 91 equivalence classes. [2025-03-04 11:28:09,406 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 62 check-sat command(s) and asserted 832 of 1241 statements. [2025-03-04 11:28:09,406 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 62 check-sat command(s) [2025-03-04 11:28:09,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:09,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 11:28:09,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:09,568 INFO L134 CoverageAnalysis]: Checked inductivity of 56467 backedges. 28557 proven. 4193 refuted. 0 times theorem prover too weak. 23717 trivial. 0 not checked. [2025-03-04 11:28:09,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 56467 backedges. 3877 proven. 8475 refuted. 0 times theorem prover too weak. 44115 trivial. 0 not checked. [2025-03-04 11:28:11,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991074551] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:11,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:11,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 29] total 39 [2025-03-04 11:28:11,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709962397] [2025-03-04 11:28:11,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:11,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-04 11:28:11,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:11,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-04 11:28:11,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1242, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 11:28:11,748 INFO L87 Difference]: Start difference. First operand 145 states and 192 transitions. Second operand has 39 states, 39 states have (on average 5.564102564102564) internal successors, (217), 38 states have internal predecessors, (217), 31 states have call successors, (39), 7 states have call predecessors, (39), 15 states have return successors, (43), 18 states have call predecessors, (43), 26 states have call successors, (43) [2025-03-04 11:28:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:12,388 INFO L93 Difference]: Finished difference Result 389 states and 583 transitions. [2025-03-04 11:28:12,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-04 11:28:12,389 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 5.564102564102564) internal successors, (217), 38 states have internal predecessors, (217), 31 states have call successors, (39), 7 states have call predecessors, (39), 15 states have return successors, (43), 18 states have call predecessors, (43), 26 states have call successors, (43) Word has length 1241 [2025-03-04 11:28:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:12,391 INFO L225 Difference]: With dead ends: 389 [2025-03-04 11:28:12,391 INFO L226 Difference]: Without dead ends: 249 [2025-03-04 11:28:12,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2562 GetRequests, 2468 SyntacticMatches, 16 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1864 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1438, Invalid=4882, Unknown=0, NotChecked=0, Total=6320 [2025-03-04 11:28:12,394 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 518 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:12,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 211 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:12,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-04 11:28:12,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 220. [2025-03-04 11:28:12,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 179 states have (on average 1.0391061452513966) internal successors, (186), 174 states have internal predecessors, (186), 28 states have call successors, (28), 22 states have call predecessors, (28), 12 states have return successors, (84), 23 states have call predecessors, (84), 27 states have call successors, (84) [2025-03-04 11:28:12,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 298 transitions. [2025-03-04 11:28:12,410 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 298 transitions. Word has length 1241 [2025-03-04 11:28:12,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:12,411 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 298 transitions. [2025-03-04 11:28:12,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.564102564102564) internal successors, (217), 38 states have internal predecessors, (217), 31 states have call successors, (39), 7 states have call predecessors, (39), 15 states have return successors, (43), 18 states have call predecessors, (43), 26 states have call successors, (43) [2025-03-04 11:28:12,411 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 298 transitions. [2025-03-04 11:28:12,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 968 [2025-03-04 11:28:12,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:12,417 INFO L218 NwaCegarLoop]: trace histogram [99, 98, 80, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 48, 31, 19, 1, 1, 1, 1] [2025-03-04 11:28:12,426 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-04 11:28:12,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:12,617 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:12,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:12,618 INFO L85 PathProgramCache]: Analyzing trace with hash 809258506, now seen corresponding path program 13 times [2025-03-04 11:28:12,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:12,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292886763] [2025-03-04 11:28:12,618 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 11:28:12,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:12,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 967 statements into 1 equivalence classes. [2025-03-04 11:28:12,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 967 of 967 statements. [2025-03-04 11:28:12,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:12,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 34128 backedges. 3250 proven. 6227 refuted. 0 times theorem prover too weak. 24651 trivial. 0 not checked. [2025-03-04 11:28:13,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:13,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292886763] [2025-03-04 11:28:13,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292886763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:13,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984722164] [2025-03-04 11:28:13,496 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 11:28:13,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:13,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:13,498 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-04 11:28:13,499 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-04 11:28:13,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 967 statements into 1 equivalence classes. [2025-03-04 11:28:13,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 967 of 967 statements. [2025-03-04 11:28:13,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:13,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:13,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 1807 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 11:28:13,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 34128 backedges. 18682 proven. 2667 refuted. 0 times theorem prover too weak. 12779 trivial. 0 not checked. [2025-03-04 11:28:13,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:17,078 INFO L134 CoverageAnalysis]: Checked inductivity of 34128 backedges. 2705 proven. 6933 refuted. 0 times theorem prover too weak. 24490 trivial. 0 not checked. [2025-03-04 11:28:17,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984722164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:17,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:17,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 27] total 29 [2025-03-04 11:28:17,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735066394] [2025-03-04 11:28:17,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:17,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 11:28:17,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:17,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 11:28:17,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2025-03-04 11:28:17,081 INFO L87 Difference]: Start difference. First operand 220 states and 298 transitions. Second operand has 29 states, 29 states have (on average 6.310344827586207) internal successors, (183), 29 states have internal predecessors, (183), 26 states have call successors, (31), 2 states have call predecessors, (31), 14 states have return successors, (40), 14 states have call predecessors, (40), 26 states have call successors, (40) [2025-03-04 11:28:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:17,424 INFO L93 Difference]: Finished difference Result 441 states and 622 transitions. [2025-03-04 11:28:17,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 11:28:17,425 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.310344827586207) internal successors, (183), 29 states have internal predecessors, (183), 26 states have call successors, (31), 2 states have call predecessors, (31), 14 states have return successors, (40), 14 states have call predecessors, (40), 26 states have call successors, (40) Word has length 967 [2025-03-04 11:28:17,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:17,427 INFO L225 Difference]: With dead ends: 441 [2025-03-04 11:28:17,428 INFO L226 Difference]: Without dead ends: 226 [2025-03-04 11:28:17,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1978 GetRequests, 1920 SyntacticMatches, 13 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=560, Invalid=1602, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 11:28:17,433 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 328 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:17,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 230 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:17,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-04 11:28:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 190. [2025-03-04 11:28:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 154 states have (on average 1.0324675324675325) internal successors, (159), 151 states have internal predecessors, (159), 25 states have call successors, (25), 20 states have call predecessors, (25), 10 states have return successors, (63), 18 states have call predecessors, (63), 24 states have call successors, (63) [2025-03-04 11:28:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2025-03-04 11:28:17,456 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 967 [2025-03-04 11:28:17,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:17,457 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2025-03-04 11:28:17,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.310344827586207) internal successors, (183), 29 states have internal predecessors, (183), 26 states have call successors, (31), 2 states have call predecessors, (31), 14 states have return successors, (40), 14 states have call predecessors, (40), 26 states have call successors, (40) [2025-03-04 11:28:17,457 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2025-03-04 11:28:17,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 909 [2025-03-04 11:28:17,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:17,463 INFO L218 NwaCegarLoop]: trace histogram [93, 92, 75, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 45, 29, 18, 1, 1, 1, 1] [2025-03-04 11:28:17,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 11:28:17,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:17,664 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:17,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:17,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2029554731, now seen corresponding path program 14 times [2025-03-04 11:28:17,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:17,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681861035] [2025-03-04 11:28:17,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:17,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:17,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 908 statements into 2 equivalence classes. [2025-03-04 11:28:17,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 908 of 908 statements. [2025-03-04 11:28:17,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:17,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 30053 backedges. 3349 proven. 5088 refuted. 0 times theorem prover too weak. 21616 trivial. 0 not checked. [2025-03-04 11:28:18,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:18,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681861035] [2025-03-04 11:28:18,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681861035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:18,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932815287] [2025-03-04 11:28:18,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:18,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:18,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:18,599 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-04 11:28:18,599 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-04 11:28:18,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 908 statements into 2 equivalence classes. [2025-03-04 11:28:18,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 908 of 908 statements. [2025-03-04 11:28:18,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:18,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:18,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 1698 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 11:28:18,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 30053 backedges. 3780 proven. 5527 refuted. 0 times theorem prover too weak. 20746 trivial. 0 not checked. [2025-03-04 11:28:19,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 30053 backedges. 3780 proven. 5699 refuted. 0 times theorem prover too weak. 20574 trivial. 0 not checked. [2025-03-04 11:28:22,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932815287] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:22,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:22,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 31] total 36 [2025-03-04 11:28:22,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285763388] [2025-03-04 11:28:22,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:22,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 11:28:22,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:22,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 11:28:22,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1041, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 11:28:22,197 INFO L87 Difference]: Start difference. First operand 190 states and 247 transitions. Second operand has 36 states, 36 states have (on average 5.472222222222222) internal successors, (197), 36 states have internal predecessors, (197), 29 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (44), 17 states have call predecessors, (44), 29 states have call successors, (44) [2025-03-04 11:28:22,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:22,667 INFO L93 Difference]: Finished difference Result 399 states and 538 transitions. [2025-03-04 11:28:22,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 11:28:22,667 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.472222222222222) internal successors, (197), 36 states have internal predecessors, (197), 29 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (44), 17 states have call predecessors, (44), 29 states have call successors, (44) Word has length 908 [2025-03-04 11:28:22,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:22,670 INFO L225 Difference]: With dead ends: 399 [2025-03-04 11:28:22,670 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 11:28:22,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1865 GetRequests, 1795 SyntacticMatches, 15 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=805, Invalid=2387, Unknown=0, NotChecked=0, Total=3192 [2025-03-04 11:28:22,672 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 300 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:22,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 261 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:28:22,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 11:28:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 166. [2025-03-04 11:28:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 133 states have (on average 1.0225563909774436) internal successors, (136), 132 states have internal predecessors, (136), 22 states have call successors, (22), 16 states have call predecessors, (22), 10 states have return successors, (56), 17 states have call predecessors, (56), 21 states have call successors, (56) [2025-03-04 11:28:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 214 transitions. [2025-03-04 11:28:22,687 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 214 transitions. Word has length 908 [2025-03-04 11:28:22,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:22,688 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 214 transitions. [2025-03-04 11:28:22,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.472222222222222) internal successors, (197), 36 states have internal predecessors, (197), 29 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (44), 17 states have call predecessors, (44), 29 states have call successors, (44) [2025-03-04 11:28:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 214 transitions. [2025-03-04 11:28:22,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2025-03-04 11:28:22,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:22,696 INFO L218 NwaCegarLoop]: trace histogram [110, 108, 89, 55, 55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 53, 34, 21, 1, 1, 1, 1] [2025-03-04 11:28:22,705 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-04 11:28:22,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:22,896 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:22,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:22,897 INFO L85 PathProgramCache]: Analyzing trace with hash -476809270, now seen corresponding path program 15 times [2025-03-04 11:28:22,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:22,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443526711] [2025-03-04 11:28:22,897 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:22,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:22,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1071 statements into 76 equivalence classes. [2025-03-04 11:28:23,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) and asserted 1071 of 1071 statements. [2025-03-04 11:28:23,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2025-03-04 11:28:23,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 41934 backedges. 7255 proven. 10190 refuted. 0 times theorem prover too weak. 24489 trivial. 0 not checked. [2025-03-04 11:28:35,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:35,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443526711] [2025-03-04 11:28:35,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443526711] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:35,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280218209] [2025-03-04 11:28:35,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:35,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:35,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:35,932 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:35,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 11:28:36,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1071 statements into 76 equivalence classes. [2025-03-04 11:28:36,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) and asserted 1071 of 1071 statements. [2025-03-04 11:28:36,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2025-03-04 11:28:36,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:36,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 1998 conjuncts, 217 conjuncts are in the unsatisfiable core [2025-03-04 11:28:36,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 41934 backedges. 6686 proven. 7855 refuted. 0 times theorem prover too weak. 27393 trivial. 0 not checked. [2025-03-04 11:28:37,188 INFO L312 TraceCheckSpWp]: Computing backward predicates...