./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Fibonacci02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci02.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 b7261cadd839cd02322bb28945f92ad1bd2170c0a65dd385996b5ff81cbb1de7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:39:53,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:39:53,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:39:53,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:39:53,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:39:53,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:39:53,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:39:53,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:39:53,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:39:53,580 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:39:53,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:39:53,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:39:53,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:39:53,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:39:53,582 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:39:53,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:39:53,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:39:53,583 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:39:53,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:39:53,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:39:53,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:39:53,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:39:53,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:39:53,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:39:53,583 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:39:53,583 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:39:53,583 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:39:53,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:39:53,583 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:39:53,583 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:39:53,583 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:39:53,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:39:53,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:39:53,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:39:53,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:39:53,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:39:53,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:39:53,584 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:39:53,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:39:53,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:39:53,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:39:53,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:39:53,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:39:53,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:39:53,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:39:53,584 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 -> b7261cadd839cd02322bb28945f92ad1bd2170c0a65dd385996b5ff81cbb1de7 [2025-03-09 02:39:53,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:39:53,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:39:53,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:39:53,791 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:39:53,791 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:39:53,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci02.c [2025-03-09 02:39:54,868 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4296fe2b/5795a1c10f5b4b96b06b0faea7d2669a/FLAGb156ad0ab [2025-03-09 02:39:55,069 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:39:55,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c [2025-03-09 02:39:55,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4296fe2b/5795a1c10f5b4b96b06b0faea7d2669a/FLAGb156ad0ab [2025-03-09 02:39:55,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4296fe2b/5795a1c10f5b4b96b06b0faea7d2669a [2025-03-09 02:39:55,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:39:55,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:39:55,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:39:55,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:39:55,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:39:55,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:39:55" (1/1) ... [2025-03-09 02:39:55,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@222a74a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:55, skipping insertion in model container [2025-03-09 02:39:55,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:39:55" (1/1) ... [2025-03-09 02:39:55,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:39:55,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:39:55,553 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:39:55,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:39:55,573 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:39:55,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:55 WrapperNode [2025-03-09 02:39:55,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:39:55,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:39:55,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:39:55,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:39:55,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:55" (1/1) ... [2025-03-09 02:39:55,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:55" (1/1) ... [2025-03-09 02:39:55,594 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2025-03-09 02:39:55,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:39:55,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:39:55,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:39:55,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:39:55,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:55" (1/1) ... [2025-03-09 02:39:55,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:55" (1/1) ... [2025-03-09 02:39:55,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:55" (1/1) ... [2025-03-09 02:39:55,612 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-09 02:39:55,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:55" (1/1) ... [2025-03-09 02:39:55,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:55" (1/1) ... [2025-03-09 02:39:55,614 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:55" (1/1) ... [2025-03-09 02:39:55,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:55" (1/1) ... [2025-03-09 02:39:55,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:55" (1/1) ... [2025-03-09 02:39:55,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:55" (1/1) ... [2025-03-09 02:39:55,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:39:55,617 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:39:55,617 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:39:55,617 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:39:55,618 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:55" (1/1) ... [2025-03-09 02:39:55,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:39:55,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:55,643 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-09 02:39:55,645 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-09 02:39:55,661 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-03-09 02:39:55,661 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-03-09 02:39:55,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:39:55,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:39:55,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:39:55,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:39:55,695 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:39:55,696 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:39:55,747 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: havoc #t~ret4;havoc #t~ret5; [2025-03-09 02:39:55,769 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-09 02:39:55,770 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:39:55,775 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:39:55,775 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:39:55,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:39:55 BoogieIcfgContainer [2025-03-09 02:39:55,776 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:39:55,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:39:55,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:39:55,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:39:55,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:39:55" (1/3) ... [2025-03-09 02:39:55,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d6648a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:39:55, skipping insertion in model container [2025-03-09 02:39:55,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:55" (2/3) ... [2025-03-09 02:39:55,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d6648a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:39:55, skipping insertion in model container [2025-03-09 02:39:55,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:39:55" (3/3) ... [2025-03-09 02:39:55,783 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2025-03-09 02:39:55,792 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:39:55,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci02.c that has 2 procedures, 31 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-09 02:39:55,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:39:55,832 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;@38ead87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:39:55,832 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 02:39:55,834 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-09 02:39:55,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 02:39:55,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:55,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:55,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:39:55,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:55,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1001399972, now seen corresponding path program 1 times [2025-03-09 02:39:55,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:55,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075898713] [2025-03-09 02:39:55,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:55,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:55,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 02:39:55,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 02:39:55,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:55,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:55,967 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-09 02:39:55,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:55,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075898713] [2025-03-09 02:39:55,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075898713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:55,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:39:55,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:39:55,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519972768] [2025-03-09 02:39:55,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:55,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:39:55,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:55,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:39:55,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:39:55,994 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-09 02:39:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:56,033 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2025-03-09 02:39:56,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:39:56,035 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-09 02:39:56,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:56,039 INFO L225 Difference]: With dead ends: 36 [2025-03-09 02:39:56,039 INFO L226 Difference]: Without dead ends: 24 [2025-03-09 02:39:56,041 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-09 02:39:56,043 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-09 02:39:56,045 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-09 02:39:56,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-09 02:39:56,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-09 02:39:56,069 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-09 02:39:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-09 02:39:56,076 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 7 [2025-03-09 02:39:56,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:56,077 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-09 02:39:56,077 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-09 02:39:56,077 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-09 02:39:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:39:56,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:56,077 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:56,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:39:56,078 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:39:56,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:56,078 INFO L85 PathProgramCache]: Analyzing trace with hash 978628045, now seen corresponding path program 1 times [2025-03-09 02:39:56,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:56,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131575249] [2025-03-09 02:39:56,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:56,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:56,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:39:56,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:39:56,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:56,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:56,138 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-09 02:39:56,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:56,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131575249] [2025-03-09 02:39:56,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131575249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:56,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:39:56,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:39:56,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253281270] [2025-03-09 02:39:56,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:56,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:39:56,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:56,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:39:56,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:39:56,140 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-09 02:39:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:56,201 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-03-09 02:39:56,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:39:56,201 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-09 02:39:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:56,202 INFO L225 Difference]: With dead ends: 24 [2025-03-09 02:39:56,202 INFO L226 Difference]: Without dead ends: 22 [2025-03-09 02:39:56,203 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-09 02:39:56,204 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-09 02:39:56,204 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-09 02:39:56,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-09 02:39:56,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-03-09 02:39:56,207 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-09 02:39:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-09 02:39:56,208 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 8 [2025-03-09 02:39:56,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:56,208 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-09 02:39:56,208 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-09 02:39:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-09 02:39:56,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 02:39:56,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:56,209 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-09 02:39:56,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:39:56,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:39:56,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:56,210 INFO L85 PathProgramCache]: Analyzing trace with hash -989645326, now seen corresponding path program 1 times [2025-03-09 02:39:56,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:56,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615249635] [2025-03-09 02:39:56,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:56,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:56,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 02:39:56,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 02:39:56,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:56,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:56,377 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-09 02:39:56,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:56,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615249635] [2025-03-09 02:39:56,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615249635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:56,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:39:56,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:39:56,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783782972] [2025-03-09 02:39:56,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:56,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:39:56,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:56,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:39:56,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:39:56,379 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-09 02:39:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:56,416 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2025-03-09 02:39:56,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:39:56,417 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-09 02:39:56,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:56,417 INFO L225 Difference]: With dead ends: 34 [2025-03-09 02:39:56,417 INFO L226 Difference]: Without dead ends: 32 [2025-03-09 02:39:56,417 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-09 02:39:56,418 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-09 02:39:56,418 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-09 02:39:56,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-09 02:39:56,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-03-09 02:39:56,422 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-09 02:39:56,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-09 02:39:56,424 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 29 [2025-03-09 02:39:56,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:56,424 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-09 02:39:56,424 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-09 02:39:56,424 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-03-09 02:39:56,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 02:39:56,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:56,426 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-09 02:39:56,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:39:56,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:39:56,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:56,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1650141125, now seen corresponding path program 1 times [2025-03-09 02:39:56,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:56,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62267946] [2025-03-09 02:39:56,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:56,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:56,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:39:56,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:39:56,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:56,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:56,529 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-09 02:39:56,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:56,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62267946] [2025-03-09 02:39:56,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62267946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:56,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439064683] [2025-03-09 02:39:56,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:56,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:56,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:56,531 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-09 02:39:56,532 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-09 02:39:56,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:39:56,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:39:56,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:56,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:56,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:39:56,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:56,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:39:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:39:56,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439064683] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:39:56,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:39:56,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-09 02:39:56,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779128872] [2025-03-09 02:39:56,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:39:56,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 02:39:56,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:56,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 02:39:56,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:39:56,769 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 15 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:39:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:57,048 INFO L93 Difference]: Finished difference Result 126 states and 180 transitions. [2025-03-09 02:39:57,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:39:57,049 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 24 [2025-03-09 02:39:57,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:57,050 INFO L225 Difference]: With dead ends: 126 [2025-03-09 02:39:57,050 INFO L226 Difference]: Without dead ends: 93 [2025-03-09 02:39:57,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-03-09 02:39:57,051 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 109 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:57,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 179 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:39:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-09 02:39:57,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2025-03-09 02:39:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 64 states have internal predecessors, (69), 11 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (32), 13 states have call predecessors, (32), 10 states have call successors, (32) [2025-03-09 02:39:57,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2025-03-09 02:39:57,066 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 24 [2025-03-09 02:39:57,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:57,067 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2025-03-09 02:39:57,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:39:57,067 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2025-03-09 02:39:57,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:39:57,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:57,068 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:57,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 02:39:57,272 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-09 02:39:57,272 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:39:57,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:57,272 INFO L85 PathProgramCache]: Analyzing trace with hash 812217045, now seen corresponding path program 2 times [2025-03-09 02:39:57,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:57,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805176294] [2025-03-09 02:39:57,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:39:57,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:57,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 02:39:57,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:39:57,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:39:57,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 02:39:57,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:57,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805176294] [2025-03-09 02:39:57,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805176294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:57,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779405437] [2025-03-09 02:39:57,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:39:57,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:57,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:57,365 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-09 02:39:57,366 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-09 02:39:57,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 02:39:57,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:39:57,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:39:57,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:57,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:39:57,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 02:39:57,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:39:57,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779405437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:57,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:39:57,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-09 02:39:57,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429698348] [2025-03-09 02:39:57,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:57,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:39:57,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:57,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:39:57,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:39:57,426 INFO L87 Difference]: Start difference. First operand 81 states and 112 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-09 02:39:57,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:57,448 INFO L93 Difference]: Finished difference Result 101 states and 141 transitions. [2025-03-09 02:39:57,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:39:57,448 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 30 [2025-03-09 02:39:57,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:57,449 INFO L225 Difference]: With dead ends: 101 [2025-03-09 02:39:57,450 INFO L226 Difference]: Without dead ends: 100 [2025-03-09 02:39:57,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 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-09 02:39:57,450 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:57,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:39:57,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-09 02:39:57,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 87. [2025-03-09 02:39:57,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 11 states have call successors, (11), 3 states have call predecessors, (11), 7 states have return successors, (39), 15 states have call predecessors, (39), 10 states have call successors, (39) [2025-03-09 02:39:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2025-03-09 02:39:57,463 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 30 [2025-03-09 02:39:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:57,463 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2025-03-09 02:39:57,463 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-09 02:39:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2025-03-09 02:39:57,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-09 02:39:57,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:57,464 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:57,469 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-09 02:39:57,664 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-09 02:39:57,664 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:39:57,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:57,665 INFO L85 PathProgramCache]: Analyzing trace with hash -591075408, now seen corresponding path program 1 times [2025-03-09 02:39:57,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:57,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910954197] [2025-03-09 02:39:57,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:57,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:57,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 02:39:57,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 02:39:57,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:57,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 02:39:57,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:57,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910954197] [2025-03-09 02:39:57,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910954197] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:57,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781205500] [2025-03-09 02:39:57,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:57,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:57,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:57,742 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-09 02:39:57,743 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-09 02:39:57,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 02:39:57,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 02:39:57,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:57,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:57,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:39:57,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:57,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:39:57,992 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:39:57,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781205500] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:39:57,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:39:57,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-09 02:39:57,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837175427] [2025-03-09 02:39:57,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:39:57,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 02:39:57,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:57,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 02:39:57,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-03-09 02:39:57,994 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:39:58,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:58,516 INFO L93 Difference]: Finished difference Result 287 states and 459 transitions. [2025-03-09 02:39:58,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 02:39:58,517 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 31 [2025-03-09 02:39:58,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:58,518 INFO L225 Difference]: With dead ends: 287 [2025-03-09 02:39:58,519 INFO L226 Difference]: Without dead ends: 209 [2025-03-09 02:39:58,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2025-03-09 02:39:58,523 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 140 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:58,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 324 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:39:58,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-09 02:39:58,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 175. [2025-03-09 02:39:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 137 states have (on average 1.094890510948905) internal successors, (150), 137 states have internal predecessors, (150), 22 states have call successors, (22), 6 states have call predecessors, (22), 14 states have return successors, (83), 31 states have call predecessors, (83), 21 states have call successors, (83) [2025-03-09 02:39:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 255 transitions. [2025-03-09 02:39:58,562 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 255 transitions. Word has length 31 [2025-03-09 02:39:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:58,562 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 255 transitions. [2025-03-09 02:39:58,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:39:58,563 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 255 transitions. [2025-03-09 02:39:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 02:39:58,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:58,564 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:58,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 02:39:58,766 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-09 02:39:58,766 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:39:58,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:58,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1168656193, now seen corresponding path program 1 times [2025-03-09 02:39:58,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:58,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747323806] [2025-03-09 02:39:58,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:58,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:58,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 02:39:58,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 02:39:58,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:58,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-09 02:39:58,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:58,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747323806] [2025-03-09 02:39:58,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747323806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:58,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:39:58,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:39:58,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722433420] [2025-03-09 02:39:58,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:58,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:39:58,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:58,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:39:58,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:39:58,837 INFO L87 Difference]: Start difference. First operand 175 states and 255 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-09 02:39:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:58,863 INFO L93 Difference]: Finished difference Result 189 states and 277 transitions. [2025-03-09 02:39:58,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:39:58,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 50 [2025-03-09 02:39:58,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:58,865 INFO L225 Difference]: With dead ends: 189 [2025-03-09 02:39:58,865 INFO L226 Difference]: Without dead ends: 188 [2025-03-09 02:39:58,865 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-09 02:39:58,868 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:58,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 83 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:39:58,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-09 02:39:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2025-03-09 02:39:58,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 143 states have (on average 1.0909090909090908) internal successors, (156), 142 states have internal predecessors, (156), 23 states have call successors, (23), 6 states have call predecessors, (23), 14 states have return successors, (89), 33 states have call predecessors, (89), 22 states have call successors, (89) [2025-03-09 02:39:58,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 268 transitions. [2025-03-09 02:39:58,894 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 268 transitions. Word has length 50 [2025-03-09 02:39:58,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:58,894 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 268 transitions. [2025-03-09 02:39:58,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-09 02:39:58,894 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 268 transitions. [2025-03-09 02:39:58,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-09 02:39:58,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:58,897 INFO L218 NwaCegarLoop]: trace histogram [11, 9, 7, 7, 7, 7, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:58,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:39:58,897 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:39:58,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:58,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2100198482, now seen corresponding path program 1 times [2025-03-09 02:39:58,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:58,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710103546] [2025-03-09 02:39:58,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:58,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:58,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-09 02:39:58,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-09 02:39:58,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:58,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:58,966 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-09 02:39:58,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:58,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710103546] [2025-03-09 02:39:58,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710103546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:58,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194122368] [2025-03-09 02:39:58,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:58,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:58,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:58,968 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-09 02:39:58,970 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-09 02:39:58,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-09 02:39:59,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-09 02:39:59,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:59,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:59,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:39:59,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 116 proven. 75 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-09 02:39:59,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:39:59,342 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 35 proven. 175 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-09 02:39:59,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194122368] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:39:59,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:39:59,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 15, 15] total 24 [2025-03-09 02:39:59,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834014505] [2025-03-09 02:39:59,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:39:59,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 02:39:59,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:59,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 02:39:59,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-03-09 02:39:59,344 INFO L87 Difference]: Start difference. First operand 182 states and 268 transitions. Second operand has 24 states, 22 states have (on average 3.727272727272727) internal successors, (82), 17 states have internal predecessors, (82), 12 states have call successors, (18), 9 states have call predecessors, (18), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-09 02:39:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:59,808 INFO L93 Difference]: Finished difference Result 496 states and 797 transitions. [2025-03-09 02:39:59,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 02:39:59,809 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.727272727272727) internal successors, (82), 17 states have internal predecessors, (82), 12 states have call successors, (18), 9 states have call predecessors, (18), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) Word has length 82 [2025-03-09 02:39:59,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:59,812 INFO L225 Difference]: With dead ends: 496 [2025-03-09 02:39:59,813 INFO L226 Difference]: Without dead ends: 329 [2025-03-09 02:39:59,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 144 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 02:39:59,816 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 245 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:59,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 479 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:39:59,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-09 02:39:59,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 302. [2025-03-09 02:39:59,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 238 states have (on average 1.096638655462185) internal successors, (261), 237 states have internal predecessors, (261), 38 states have call successors, (38), 11 states have call predecessors, (38), 24 states have return successors, (115), 53 states have call predecessors, (115), 37 states have call successors, (115) [2025-03-09 02:39:59,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 414 transitions. [2025-03-09 02:39:59,846 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 414 transitions. Word has length 82 [2025-03-09 02:39:59,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:59,847 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 414 transitions. [2025-03-09 02:39:59,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.727272727272727) internal successors, (82), 17 states have internal predecessors, (82), 12 states have call successors, (18), 9 states have call predecessors, (18), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-09 02:39:59,848 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 414 transitions. [2025-03-09 02:39:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-09 02:39:59,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:59,850 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 10, 10, 10, 10, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:59,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 02:40:00,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:00,050 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:00,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash 155991522, now seen corresponding path program 1 times [2025-03-09 02:40:00,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:00,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159408271] [2025-03-09 02:40:00,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:40:00,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:00,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 02:40:00,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 02:40:00,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:00,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-03-09 02:40:00,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:00,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159408271] [2025-03-09 02:40:00,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159408271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:00,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24081681] [2025-03-09 02:40:00,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:40:00,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:00,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:00,139 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-09 02:40:00,141 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-09 02:40:00,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 02:40:00,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 02:40:00,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:00,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:00,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 02:40:00,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 366 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:40:00,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:00,626 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 226 proven. 158 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-09 02:40:00,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24081681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:00,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:00,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 21, 21] total 24 [2025-03-09 02:40:00,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64828465] [2025-03-09 02:40:00,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:00,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 02:40:00,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:00,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 02:40:00,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2025-03-09 02:40:00,628 INFO L87 Difference]: Start difference. First operand 302 states and 414 transitions. Second operand has 24 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 15 states have internal predecessors, (85), 12 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 02:40:00,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:00,993 INFO L93 Difference]: Finished difference Result 579 states and 828 transitions. [2025-03-09 02:40:00,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-09 02:40:00,993 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 15 states have internal predecessors, (85), 12 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 102 [2025-03-09 02:40:00,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:00,995 INFO L225 Difference]: With dead ends: 579 [2025-03-09 02:40:00,996 INFO L226 Difference]: Without dead ends: 298 [2025-03-09 02:40:00,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 172 SyntacticMatches, 19 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=342, Invalid=990, Unknown=0, NotChecked=0, Total=1332 [2025-03-09 02:40:00,999 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 335 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:00,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 159 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:40:01,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-09 02:40:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 275. [2025-03-09 02:40:01,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 216 states have (on average 1.0972222222222223) internal successors, (237), 217 states have internal predecessors, (237), 34 states have call successors, (34), 12 states have call predecessors, (34), 23 states have return successors, (69), 45 states have call predecessors, (69), 33 states have call successors, (69) [2025-03-09 02:40:01,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 340 transitions. [2025-03-09 02:40:01,015 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 340 transitions. Word has length 102 [2025-03-09 02:40:01,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:01,017 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 340 transitions. [2025-03-09 02:40:01,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 15 states have internal predecessors, (85), 12 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 02:40:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 340 transitions. [2025-03-09 02:40:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-09 02:40:01,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:01,019 INFO L218 NwaCegarLoop]: trace histogram [11, 9, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 02:40:01,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 02:40:01,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:01,220 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:01,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:01,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1819918755, now seen corresponding path program 2 times [2025-03-09 02:40:01,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:01,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486441964] [2025-03-09 02:40:01,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:01,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:01,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-03-09 02:40:01,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 02:40:01,231 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:01,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-09 02:40:01,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:01,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486441964] [2025-03-09 02:40:01,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486441964] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:01,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440313774] [2025-03-09 02:40:01,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:01,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:01,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:01,293 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-09 02:40:01,295 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-09 02:40:01,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-03-09 02:40:01,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 02:40:01,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:01,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:01,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 02:40:01,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 43 proven. 202 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:40:01,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 9 proven. 231 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 02:40:01,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440313774] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:01,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:01,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 20, 21] total 24 [2025-03-09 02:40:01,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272026368] [2025-03-09 02:40:01,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:01,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 02:40:01,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:01,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 02:40:01,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2025-03-09 02:40:01,799 INFO L87 Difference]: Start difference. First operand 275 states and 340 transitions. Second operand has 24 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 17 states have internal predecessors, (82), 14 states have call successors, (16), 9 states have call predecessors, (16), 4 states have return successors, (8), 2 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-09 02:40:02,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:02,087 INFO L93 Difference]: Finished difference Result 444 states and 561 transitions. [2025-03-09 02:40:02,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 02:40:02,087 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 17 states have internal predecessors, (82), 14 states have call successors, (16), 9 states have call predecessors, (16), 4 states have return successors, (8), 2 states have call predecessors, (8), 7 states have call successors, (8) Word has length 80 [2025-03-09 02:40:02,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:02,088 INFO L225 Difference]: With dead ends: 444 [2025-03-09 02:40:02,088 INFO L226 Difference]: Without dead ends: 188 [2025-03-09 02:40:02,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 134 SyntacticMatches, 17 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=279, Invalid=777, Unknown=0, NotChecked=0, Total=1056 [2025-03-09 02:40:02,090 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 237 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:02,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 376 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:40:02,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-09 02:40:02,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 176. [2025-03-09 02:40:02,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 139 states have (on average 1.143884892086331) internal successors, (159), 140 states have internal predecessors, (159), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (24), 23 states have call predecessors, (24), 22 states have call successors, (24) [2025-03-09 02:40:02,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 206 transitions. [2025-03-09 02:40:02,103 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 206 transitions. Word has length 80 [2025-03-09 02:40:02,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:02,103 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 206 transitions. [2025-03-09 02:40:02,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 17 states have internal predecessors, (82), 14 states have call successors, (16), 9 states have call predecessors, (16), 4 states have return successors, (8), 2 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-09 02:40:02,103 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 206 transitions. [2025-03-09 02:40:02,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-09 02:40:02,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:02,104 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 02:40:02,110 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-09 02:40:02,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:02,305 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:02,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:02,307 INFO L85 PathProgramCache]: Analyzing trace with hash 556285496, now seen corresponding path program 3 times [2025-03-09 02:40:02,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:02,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691980024] [2025-03-09 02:40:02,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:40:02,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:02,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 81 statements into 11 equivalence classes. [2025-03-09 02:40:02,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 81 statements. [2025-03-09 02:40:02,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 02:40:02,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-09 02:40:02,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:02,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691980024] [2025-03-09 02:40:02,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691980024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:02,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686972587] [2025-03-09 02:40:02,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:40:02,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:02,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:02,399 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-09 02:40:02,400 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-09 02:40:02,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 81 statements into 11 equivalence classes. [2025-03-09 02:40:02,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 81 statements. [2025-03-09 02:40:02,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 02:40:02,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:02,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:40:02,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:02,488 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2025-03-09 02:40:02,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:02,615 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-09 02:40:02,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686972587] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:02,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:02,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-03-09 02:40:02,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672001273] [2025-03-09 02:40:02,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:02,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 02:40:02,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:02,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 02:40:02,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:40:02,617 INFO L87 Difference]: Start difference. First operand 176 states and 206 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-09 02:40:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:02,678 INFO L93 Difference]: Finished difference Result 178 states and 206 transitions. [2025-03-09 02:40:02,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:40:02,679 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 81 [2025-03-09 02:40:02,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:02,684 INFO L225 Difference]: With dead ends: 178 [2025-03-09 02:40:02,684 INFO L226 Difference]: Without dead ends: 176 [2025-03-09 02:40:02,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-03-09 02:40:02,685 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:02,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 143 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:40:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-09 02:40:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2025-03-09 02:40:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 137 states have (on average 1.1240875912408759) internal successors, (154), 139 states have internal predecessors, (154), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2025-03-09 02:40:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 201 transitions. [2025-03-09 02:40:02,694 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 201 transitions. Word has length 81 [2025-03-09 02:40:02,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:02,694 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 201 transitions. [2025-03-09 02:40:02,695 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-09 02:40:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 201 transitions. [2025-03-09 02:40:02,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-09 02:40:02,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:02,695 INFO L218 NwaCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1] [2025-03-09 02:40:02,701 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-09 02:40:02,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:02,896 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:02,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:02,897 INFO L85 PathProgramCache]: Analyzing trace with hash -643062752, now seen corresponding path program 2 times [2025-03-09 02:40:02,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:02,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665315223] [2025-03-09 02:40:02,897 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:02,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:02,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-03-09 02:40:02,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 02:40:02,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:02,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:03,138 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 14 proven. 64 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-03-09 02:40:03,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:03,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665315223] [2025-03-09 02:40:03,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665315223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:03,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771372271] [2025-03-09 02:40:03,139 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:03,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:03,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:03,141 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-09 02:40:03,142 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-09 02:40:03,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-03-09 02:40:03,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 02:40:03,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:03,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:03,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 02:40:03,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 25 proven. 54 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-03-09 02:40:03,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 25 proven. 56 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-09 02:40:03,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771372271] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:03,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:03,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2025-03-09 02:40:03,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140917732] [2025-03-09 02:40:03,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:03,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 02:40:03,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:03,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 02:40:03,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2025-03-09 02:40:03,520 INFO L87 Difference]: Start difference. First operand 174 states and 201 transitions. Second operand has 22 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (16), 13 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-09 02:40:03,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:03,595 INFO L93 Difference]: Finished difference Result 174 states and 201 transitions. [2025-03-09 02:40:03,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 02:40:03,599 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (16), 13 states have call predecessors, (16), 6 states have call successors, (16) Word has length 113 [2025-03-09 02:40:03,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:03,600 INFO L225 Difference]: With dead ends: 174 [2025-03-09 02:40:03,600 INFO L226 Difference]: Without dead ends: 173 [2025-03-09 02:40:03,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 218 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2025-03-09 02:40:03,600 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:03,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 228 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:40:03,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-09 02:40:03,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-03-09 02:40:03,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 137 states have (on average 1.0583941605839415) internal successors, (145), 138 states have internal predecessors, (145), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2025-03-09 02:40:03,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 192 transitions. [2025-03-09 02:40:03,608 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 192 transitions. Word has length 113 [2025-03-09 02:40:03,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:03,609 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 192 transitions. [2025-03-09 02:40:03,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (16), 13 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-09 02:40:03,609 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 192 transitions. [2025-03-09 02:40:03,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-09 02:40:03,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:03,610 INFO L218 NwaCegarLoop]: trace histogram [19, 16, 14, 11, 11, 11, 11, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 3, 1, 1, 1, 1] [2025-03-09 02:40:03,616 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-09 02:40:03,810 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-09 02:40:03,811 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:03,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:03,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1252282038, now seen corresponding path program 4 times [2025-03-09 02:40:03,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:03,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083520935] [2025-03-09 02:40:03,811 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:40:03,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:03,816 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 167 statements into 2 equivalence classes. [2025-03-09 02:40:03,825 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 167 of 167 statements. [2025-03-09 02:40:03,826 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 02:40:03,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 78 proven. 135 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2025-03-09 02:40:04,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:04,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083520935] [2025-03-09 02:40:04,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083520935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:04,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575831449] [2025-03-09 02:40:04,262 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:40:04,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:04,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:04,266 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-09 02:40:04,267 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-09 02:40:04,295 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 167 statements into 2 equivalence classes. [2025-03-09 02:40:04,320 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 167 of 167 statements. [2025-03-09 02:40:04,320 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 02:40:04,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:04,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 02:40:04,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 78 proven. 135 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2025-03-09 02:40:04,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 144 proven. 128 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-09 02:40:05,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575831449] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:05,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:05,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 26 [2025-03-09 02:40:05,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063169725] [2025-03-09 02:40:05,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:05,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-09 02:40:05,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:05,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-09 02:40:05,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2025-03-09 02:40:05,356 INFO L87 Difference]: Start difference. First operand 173 states and 192 transitions. Second operand has 27 states, 26 states have (on average 2.730769230769231) internal successors, (71), 27 states have internal predecessors, (71), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-09 02:40:05,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:05,422 INFO L93 Difference]: Finished difference Result 174 states and 192 transitions. [2025-03-09 02:40:05,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 02:40:05,423 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.730769230769231) internal successors, (71), 27 states have internal predecessors, (71), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) Word has length 167 [2025-03-09 02:40:05,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:05,424 INFO L225 Difference]: With dead ends: 174 [2025-03-09 02:40:05,424 INFO L226 Difference]: Without dead ends: 173 [2025-03-09 02:40:05,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 320 SyntacticMatches, 16 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2025-03-09 02:40:05,424 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:05,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 187 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:40:05,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-09 02:40:05,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-03-09 02:40:05,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 137 states have (on average 1.0291970802919708) internal successors, (141), 138 states have internal predecessors, (141), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2025-03-09 02:40:05,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 188 transitions. [2025-03-09 02:40:05,433 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 188 transitions. Word has length 167 [2025-03-09 02:40:05,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:05,434 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 188 transitions. [2025-03-09 02:40:05,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.730769230769231) internal successors, (71), 27 states have internal predecessors, (71), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-09 02:40:05,434 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 188 transitions. [2025-03-09 02:40:05,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-03-09 02:40:05,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:05,438 INFO L218 NwaCegarLoop]: trace histogram [43, 40, 35, 22, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 20, 19, 13, 8, 1, 1, 1, 1] [2025-03-09 02:40:05,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 02:40:05,643 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-09 02:40:05,643 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:05,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:05,643 INFO L85 PathProgramCache]: Analyzing trace with hash -300200331, now seen corresponding path program 5 times [2025-03-09 02:40:05,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:05,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233614344] [2025-03-09 02:40:05,644 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:40:05,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:05,656 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 410 statements into 31 equivalence classes. [2025-03-09 02:40:05,707 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 410 of 410 statements. [2025-03-09 02:40:05,707 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-03-09 02:40:05,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:07,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 998 proven. 1424 refuted. 0 times theorem prover too weak. 3562 trivial. 0 not checked. [2025-03-09 02:40:07,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:07,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233614344] [2025-03-09 02:40:07,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233614344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:07,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944898128] [2025-03-09 02:40:07,874 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:40:07,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:07,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:07,876 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-09 02:40:07,877 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-09 02:40:07,927 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 410 statements into 31 equivalence classes. [2025-03-09 02:40:08,016 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 410 of 410 statements. [2025-03-09 02:40:08,016 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-03-09 02:40:08,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:08,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-09 02:40:08,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2025-03-09 02:40:08,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 1149 proven. 1015 refuted. 0 times theorem prover too weak. 3820 trivial. 0 not checked. [2025-03-09 02:40:13,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944898128] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:13,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:13,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18, 29] total 47 [2025-03-09 02:40:13,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097655233] [2025-03-09 02:40:13,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:13,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-09 02:40:13,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:13,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-09 02:40:13,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1730, Unknown=0, NotChecked=0, Total=2256 [2025-03-09 02:40:13,401 INFO L87 Difference]: Start difference. First operand 173 states and 188 transitions. Second operand has 48 states, 47 states have (on average 2.6382978723404253) internal successors, (124), 48 states have internal predecessors, (124), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (34), 33 states have call predecessors, (34), 12 states have call successors, (34) [2025-03-09 02:40:13,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:13,497 INFO L93 Difference]: Finished difference Result 174 states and 188 transitions. [2025-03-09 02:40:13,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 02:40:13,498 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.6382978723404253) internal successors, (124), 48 states have internal predecessors, (124), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (34), 33 states have call predecessors, (34), 12 states have call successors, (34) Word has length 410 [2025-03-09 02:40:13,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:13,499 INFO L225 Difference]: With dead ends: 174 [2025-03-09 02:40:13,499 INFO L226 Difference]: Without dead ends: 173 [2025-03-09 02:40:13,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 798 SyntacticMatches, 55 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2573 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=575, Invalid=1875, Unknown=0, NotChecked=0, Total=2450 [2025-03-09 02:40:13,500 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:13,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 143 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:40:13,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-09 02:40:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-03-09 02:40:13,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 137 states have (on average 1.0072992700729928) internal successors, (138), 138 states have internal predecessors, (138), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2025-03-09 02:40:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 185 transitions. [2025-03-09 02:40:13,507 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 185 transitions. Word has length 410 [2025-03-09 02:40:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:13,509 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 185 transitions. [2025-03-09 02:40:13,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.6382978723404253) internal successors, (124), 48 states have internal predecessors, (124), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (34), 33 states have call predecessors, (34), 12 states have call successors, (34) [2025-03-09 02:40:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 185 transitions. [2025-03-09 02:40:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1066 [2025-03-09 02:40:13,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:13,527 INFO L218 NwaCegarLoop]: trace histogram [109, 108, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 34, 21, 1, 1, 1, 1] [2025-03-09 02:40:13,534 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-09 02:40:13,731 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-09 02:40:13,731 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:13,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:13,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1029407192, now seen corresponding path program 6 times [2025-03-09 02:40:13,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:13,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536327279] [2025-03-09 02:40:13,732 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 02:40:13,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:13,758 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1065 statements into 83 equivalence classes. [2025-03-09 02:40:13,933 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 83 check-sat command(s) and asserted 1065 of 1065 statements. [2025-03-09 02:40:13,933 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 83 check-sat command(s) [2025-03-09 02:40:13,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 7341 proven. 10021 refuted. 0 times theorem prover too weak. 24104 trivial. 0 not checked. [2025-03-09 02:40:26,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:26,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536327279] [2025-03-09 02:40:26,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536327279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:26,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78863747] [2025-03-09 02:40:26,778 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 02:40:26,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:26,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:26,780 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-09 02:40:26,781 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-09 02:40:26,913 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1065 statements into 83 equivalence classes. [2025-03-09 02:40:27,175 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 83 check-sat command(s) and asserted 1065 of 1065 statements. [2025-03-09 02:40:27,175 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 83 check-sat command(s) [2025-03-09 02:40:27,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:27,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 1988 conjuncts, 217 conjuncts are in the unsatisfiable core [2025-03-09 02:40:27,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:27,906 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 6686 proven. 7855 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2025-03-09 02:40:27,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 7863 proven. 7392 refuted. 0 times theorem prover too weak. 26211 trivial. 0 not checked. [2025-03-09 02:40:59,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78863747] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:59,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:59,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 41] total 60 [2025-03-09 02:40:59,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806925076] [2025-03-09 02:40:59,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:59,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-09 02:40:59,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:59,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-09 02:40:59,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=2848, Unknown=0, NotChecked=0, Total=3660 [2025-03-09 02:40:59,472 INFO L87 Difference]: Start difference. First operand 173 states and 185 transitions. Second operand has 61 states, 60 states have (on average 2.5833333333333335) internal successors, (155), 61 states have internal predecessors, (155), 16 states have call successors, (17), 1 states have call predecessors, (17), 17 states have return successors, (42), 42 states have call predecessors, (42), 16 states have call successors, (42) [2025-03-09 02:40:59,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:59,559 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2025-03-09 02:40:59,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-09 02:40:59,560 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.5833333333333335) internal successors, (155), 61 states have internal predecessors, (155), 16 states have call successors, (17), 1 states have call predecessors, (17), 17 states have return successors, (42), 42 states have call predecessors, (42), 16 states have call successors, (42) Word has length 1065 [2025-03-09 02:40:59,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:59,562 INFO L225 Difference]: With dead ends: 173 [2025-03-09 02:40:59,562 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:40:59,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2346 GetRequests, 2094 SyntacticMatches, 192 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7056 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=852, Invalid=2930, Unknown=0, NotChecked=0, Total=3782 [2025-03-09 02:40:59,564 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:59,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 204 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:40:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:40:59,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:40:59,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:40:59,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:40:59,565 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1065 [2025-03-09 02:40:59,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:59,565 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:40:59,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.5833333333333335) internal successors, (155), 61 states have internal predecessors, (155), 16 states have call successors, (17), 1 states have call predecessors, (17), 17 states have return successors, (42), 42 states have call predecessors, (42), 16 states have call successors, (42) [2025-03-09 02:40:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:40:59,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:40:59,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-09 02:40:59,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-09 02:40:59,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-09 02:40:59,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-09 02:40:59,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-09 02:40:59,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-09 02:40:59,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 02:40:59,768 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-09 02:40:59,771 INFO L422 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 02:40:59,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:41:00,552 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:41:00,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:41:00 BoogieIcfgContainer [2025-03-09 02:41:00,556 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:41:00,556 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:41:00,556 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:41:00,556 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:41:00,557 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:39:55" (3/4) ... [2025-03-09 02:41:00,558 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:41:00,563 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibonacci [2025-03-09 02:41:00,565 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 02:41:00,565 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:41:00,565 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:41:00,566 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:41:00,617 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:41:00,617 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:41:00,617 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:41:00,618 INFO L158 Benchmark]: Toolchain (without parser) took 65191.98ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 105.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 100.9MB. Max. memory is 16.1GB. [2025-03-09 02:41:00,618 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:41:00,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.92ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 95.4MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:41:00,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.85ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 94.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:41:00,619 INFO L158 Benchmark]: Boogie Preprocessor took 21.82ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 93.5MB in the end (delta: 605.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:41:00,619 INFO L158 Benchmark]: IcfgBuilder took 159.01ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 82.6MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:41:00,619 INFO L158 Benchmark]: TraceAbstraction took 64778.61ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 82.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 923.2MB. Max. memory is 16.1GB. [2025-03-09 02:41:00,619 INFO L158 Benchmark]: Witness Printer took 60.85ms. Allocated memory is still 1.6GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:41:00,620 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.87ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 147.92ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 95.4MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.85ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 94.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.82ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 93.5MB in the end (delta: 605.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 159.01ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 82.6MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 64778.61ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 82.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 923.2MB. Max. memory is 16.1GB. * Witness Printer took 60.85ms. Allocated memory is still 1.6GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 38 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 64.0s, OverallIterations: 15, TraceHistogramMax: 109, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1167 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1137 mSDsluCounter, 2674 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2243 mSDsCounter, 303 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3376 IncrementalHoareTripleChecker+Invalid, 3679 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 303 mSolverCounterUnsat, 431 mSDtfsCounter, 3376 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4812 GetRequests, 4161 SyntacticMatches, 314 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11566 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=8, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 136 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 57.4s InterpolantComputationTime, 4464 NumberOfCodeBlocks, 4368 NumberOfCodeBlocksAsserted, 262 NumberOfCheckSat, 6583 ConstructedInterpolants, 0 QuantifiedInterpolants, 15680 SizeOfPredicates, 26 NumberOfNonLiveVariables, 4150 ConjunctsInSsa, 420 ConjunctsInUnsatCore, 36 InterpolantComputations, 5 PerfectInterpolantSequences, 119990/150351 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 02:41:00,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE