./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/Fibonacci01-2-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-numeric/Fibonacci01-2-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 694713b32fd9c1719d4a8995f33c66cfa1f4ebdac7358c65fcc55ce37970cfaf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:32:52,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:32:52,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:32:52,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:32:52,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:32:52,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:32:52,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:32:52,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:32:52,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:32:52,570 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:32:52,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:32:52,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:32:52,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:32:52,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:32:52,570 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:32:52,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:32:52,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:32:52,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:32:52,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:32:52,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:32:52,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:32:52,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:32:52,571 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:32:52,571 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:32:52,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:32:52,571 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:32:52,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:32:52,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:32:52,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:32:52,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:32:52,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:32:52,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:32:52,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:32:52,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:32:52,573 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:32:52,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:32:52,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:32:52,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:32:52,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:32:52,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:32:52,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:32:52,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:32:52,574 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 694713b32fd9c1719d4a8995f33c66cfa1f4ebdac7358c65fcc55ce37970cfaf [2025-03-04 10:32:52,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:32:52,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:32:52,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:32:52,778 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:32:52,778 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:32:52,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Fibonacci01-2-overflow.c [2025-03-04 10:32:53,883 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe2ad181/02aa85e082c041809071ffca5b0adc66/FLAG8bb774280 [2025-03-04 10:32:54,126 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:32:54,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Fibonacci01-2-overflow.c [2025-03-04 10:32:54,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe2ad181/02aa85e082c041809071ffca5b0adc66/FLAG8bb774280 [2025-03-04 10:32:54,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe2ad181/02aa85e082c041809071ffca5b0adc66 [2025-03-04 10:32:54,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:32:54,462 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:32:54,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:32:54,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:32:54,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:32:54,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:32:54" (1/1) ... [2025-03-04 10:32:54,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d389e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:54, skipping insertion in model container [2025-03-04 10:32:54,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:32:54" (1/1) ... [2025-03-04 10:32:54,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:32:54,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:32:54,592 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:32:54,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:32:54,613 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:32:54,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:54 WrapperNode [2025-03-04 10:32:54,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:32:54,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:32:54,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:32:54,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:32:54,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:54" (1/1) ... [2025-03-04 10:32:54,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:54" (1/1) ... [2025-03-04 10:32:54,635 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2025-03-04 10:32:54,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:32:54,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:32:54,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:32:54,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:32:54,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:54" (1/1) ... [2025-03-04 10:32:54,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:54" (1/1) ... [2025-03-04 10:32:54,642 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:54" (1/1) ... [2025-03-04 10:32:54,653 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 10:32:54,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:54" (1/1) ... [2025-03-04 10:32:54,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:54" (1/1) ... [2025-03-04 10:32:54,657 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:54" (1/1) ... [2025-03-04 10:32:54,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:54" (1/1) ... [2025-03-04 10:32:54,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:54" (1/1) ... [2025-03-04 10:32:54,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:54" (1/1) ... [2025-03-04 10:32:54,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:32:54,659 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:32:54,659 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:32:54,659 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:32:54,660 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:54" (1/1) ... [2025-03-04 10:32:54,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:32:54,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:54,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:32:54,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:32:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-03-04 10:32:54,711 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-03-04 10:32:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:32:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:32:54,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:32:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:32:54,753 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:32:54,755 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:32:54,807 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: havoc #t~ret4;havoc #t~ret5; [2025-03-04 10:32:54,828 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-04 10:32:54,828 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:32:54,838 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:32:54,839 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:32:54,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:32:54 BoogieIcfgContainer [2025-03-04 10:32:54,839 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:32:54,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:32:54,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:32:54,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:32:54,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:32:54" (1/3) ... [2025-03-04 10:32:54,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b88072f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:32:54, skipping insertion in model container [2025-03-04 10:32:54,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:54" (2/3) ... [2025-03-04 10:32:54,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b88072f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:32:54, skipping insertion in model container [2025-03-04 10:32:54,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:32:54" (3/3) ... [2025-03-04 10:32:54,850 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci01-2-overflow.c [2025-03-04 10:32:54,860 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:32:54,861 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci01-2-overflow.c that has 2 procedures, 32 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-04 10:32:54,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:32:54,910 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;@312cfea6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:32:54,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 10:32:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:32:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:32:54,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:54,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:54,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:54,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:54,922 INFO L85 PathProgramCache]: Analyzing trace with hash 154990982, now seen corresponding path program 1 times [2025-03-04 10:32:54,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:54,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574492909] [2025-03-04 10:32:54,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:54,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:54,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:32:54,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:32:54,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:54,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:55,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:55,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574492909] [2025-03-04 10:32:55,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574492909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:55,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:55,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:32:55,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791814338] [2025-03-04 10:32:55,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:55,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:32:55,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:55,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:32:55,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:32:55,093 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 27 states have internal predecessors, (31), 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.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:55,132 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-03-04 10:32:55,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:32:55,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 10:32:55,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:55,139 INFO L225 Difference]: With dead ends: 37 [2025-03-04 10:32:55,139 INFO L226 Difference]: Without dead ends: 25 [2025-03-04 10:32:55,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:32:55,144 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:55,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 44 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-04 10:32:55,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-03-04 10:32:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:32:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-04 10:32:55,178 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 8 [2025-03-04 10:32:55,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:55,179 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-04 10:32:55,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:55,180 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-03-04 10:32:55,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:32:55,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:55,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:55,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:32:55,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:55,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:55,183 INFO L85 PathProgramCache]: Analyzing trace with hash 509753131, now seen corresponding path program 1 times [2025-03-04 10:32:55,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:55,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206407807] [2025-03-04 10:32:55,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:55,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:55,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:32:55,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:32:55,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:55,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:55,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:55,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:55,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206407807] [2025-03-04 10:32:55,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206407807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:55,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:55,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:32:55,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661851818] [2025-03-04 10:32:55,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:55,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:55,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:55,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:55,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:55,269 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:55,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:55,330 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2025-03-04 10:32:55,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:32:55,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2025-03-04 10:32:55,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:55,331 INFO L225 Difference]: With dead ends: 25 [2025-03-04 10:32:55,331 INFO L226 Difference]: Without dead ends: 23 [2025-03-04 10:32:55,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:32:55,332 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:55,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:55,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-04 10:32:55,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-03-04 10:32:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:32:55,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-04 10:32:55,338 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 9 [2025-03-04 10:32:55,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:55,339 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-04 10:32:55,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-04 10:32:55,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:32:55,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:55,340 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:55,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:32:55,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:55,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:55,342 INFO L85 PathProgramCache]: Analyzing trace with hash -984405394, now seen corresponding path program 1 times [2025-03-04 10:32:55,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:55,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718346997] [2025-03-04 10:32:55,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:55,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:55,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:32:55,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:32:55,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:55,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:32:55,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:55,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718346997] [2025-03-04 10:32:55,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718346997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:55,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:55,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:32:55,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245917431] [2025-03-04 10:32:55,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:55,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:55,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:55,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:55,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:55,460 INFO L87 Difference]: Start difference. First operand 21 states and 24 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-04 10:32:55,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:55,501 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-03-04 10:32:55,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:32:55,502 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 24 [2025-03-04 10:32:55,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:55,503 INFO L225 Difference]: With dead ends: 35 [2025-03-04 10:32:55,504 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 10:32:55,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:55,505 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:55,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:55,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 10:32:55,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2025-03-04 10:32:55,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:32:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-03-04 10:32:55,515 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 24 [2025-03-04 10:32:55,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:55,515 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-04 10:32:55,515 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-04 10:32:55,515 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-03-04 10:32:55,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 10:32:55,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:55,516 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-04 10:32:55,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:32:55,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:55,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:55,516 INFO L85 PathProgramCache]: Analyzing trace with hash -119709208, now seen corresponding path program 1 times [2025-03-04 10:32:55,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:55,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263721650] [2025-03-04 10:32:55,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:55,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:55,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:32:55,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:32:55,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:55,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:55,620 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-04 10:32:55,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:55,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263721650] [2025-03-04 10:32:55,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263721650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:55,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219753034] [2025-03-04 10:32:55,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:55,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:55,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:55,623 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:55,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:32:55,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:32:55,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:32:55,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:55,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:55,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:32:55,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 10:32:55,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:55,910 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 10:32:55,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219753034] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:55,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:55,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-04 10:32:55,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472557700] [2025-03-04 10:32:55,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:55,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:32:55,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:55,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:32:55,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:32:55,912 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:32:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:56,157 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2025-03-04 10:32:56,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:32:56,159 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2025-03-04 10:32:56,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:56,160 INFO L225 Difference]: With dead ends: 91 [2025-03-04 10:32:56,160 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 10:32:56,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:32:56,162 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 134 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:56,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 92 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:56,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 10:32:56,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2025-03-04 10:32:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 42 states have internal predecessors, (43), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 10:32:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2025-03-04 10:32:56,172 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 31 [2025-03-04 10:32:56,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:56,172 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2025-03-04 10:32:56,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:32:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2025-03-04 10:32:56,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 10:32:56,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:56,173 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:56,180 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-04 10:32:56,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:56,374 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:56,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:56,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1220480843, now seen corresponding path program 2 times [2025-03-04 10:32:56,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:56,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638405408] [2025-03-04 10:32:56,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:56,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:56,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:32:56,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:32:56,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:56,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:56,455 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:32:56,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:56,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638405408] [2025-03-04 10:32:56,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638405408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:56,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862830757] [2025-03-04 10:32:56,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:56,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:56,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:56,458 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:56,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:32:56,480 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:32:56,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:32:56,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:56,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:56,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:32:56,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:32:56,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:32:56,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862830757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:56,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:32:56,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-04 10:32:56,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606546899] [2025-03-04 10:32:56,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:56,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:56,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:56,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:56,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:32:56,533 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:32:56,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:56,560 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2025-03-04 10:32:56,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:32:56,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-03-04 10:32:56,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:56,562 INFO L225 Difference]: With dead ends: 60 [2025-03-04 10:32:56,562 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 10:32:56,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:32:56,562 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 51 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-04 10:32:56,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 51 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:56,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 10:32:56,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2025-03-04 10:32:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 43 states have internal predecessors, (45), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 10:32:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2025-03-04 10:32:56,576 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 25 [2025-03-04 10:32:56,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:56,576 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2025-03-04 10:32:56,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:32:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2025-03-04 10:32:56,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 10:32:56,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:56,577 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, 1] [2025-03-04 10:32:56,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:56,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:56,778 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:56,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:56,778 INFO L85 PathProgramCache]: Analyzing trace with hash 929820207, now seen corresponding path program 1 times [2025-03-04 10:32:56,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:56,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265821985] [2025-03-04 10:32:56,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:56,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:56,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:32:56,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:32:56,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:56,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:56,849 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-04 10:32:56,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:56,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265821985] [2025-03-04 10:32:56,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265821985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:56,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941243838] [2025-03-04 10:32:56,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:56,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:56,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:56,852 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:56,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:32:56,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:32:56,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:32:56,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:56,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:56,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:32:56,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:56,936 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-04 10:32:56,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:32:56,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941243838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:56,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:32:56,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 10:32:56,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534135163] [2025-03-04 10:32:56,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:56,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:32:56,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:56,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:32:56,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:32:56,938 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:32:56,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:56,966 INFO L93 Difference]: Finished difference Result 82 states and 117 transitions. [2025-03-04 10:32:56,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:32:56,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 32 [2025-03-04 10:32:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:56,967 INFO L225 Difference]: With dead ends: 82 [2025-03-04 10:32:56,967 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 10:32:56,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:32:56,968 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:56,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 71 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 10:32:56,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2025-03-04 10:32:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (27), 11 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-04 10:32:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2025-03-04 10:32:56,977 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 32 [2025-03-04 10:32:56,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:56,977 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2025-03-04 10:32:56,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:32:56,978 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2025-03-04 10:32:56,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 10:32:56,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:56,982 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:56,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:57,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:57,183 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:57,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:57,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1465088786, now seen corresponding path program 1 times [2025-03-04 10:32:57,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:57,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713452349] [2025-03-04 10:32:57,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:57,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:57,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:32:57,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:32:57,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:57,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 10:32:57,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:57,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713452349] [2025-03-04 10:32:57,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713452349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:57,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471429272] [2025-03-04 10:32:57,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:57,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:57,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:57,336 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:57,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:32:57,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:32:57,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:32:57,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:57,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:57,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:32:57,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-04 10:32:57,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:57,610 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 10:32:57,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471429272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:57,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:57,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-03-04 10:32:57,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357397192] [2025-03-04 10:32:57,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:57,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:32:57,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:57,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:32:57,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:32:57,613 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 10:32:57,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:57,800 INFO L93 Difference]: Finished difference Result 141 states and 217 transitions. [2025-03-04 10:32:57,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:32:57,802 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 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 46 [2025-03-04 10:32:57,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:57,804 INFO L225 Difference]: With dead ends: 141 [2025-03-04 10:32:57,804 INFO L226 Difference]: Without dead ends: 139 [2025-03-04 10:32:57,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:32:57,805 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:57,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 194 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-04 10:32:57,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 98. [2025-03-04 10:32:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 75 states have internal predecessors, (82), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2025-03-04 10:32:57,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 159 transitions. [2025-03-04 10:32:57,824 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 159 transitions. Word has length 46 [2025-03-04 10:32:57,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:57,825 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 159 transitions. [2025-03-04 10:32:57,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 10:32:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 159 transitions. [2025-03-04 10:32:57,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 10:32:57,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:57,829 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:57,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:32:58,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:58,031 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:58,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:58,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1138642878, now seen corresponding path program 1 times [2025-03-04 10:32:58,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:58,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246281625] [2025-03-04 10:32:58,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:58,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:58,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 10:32:58,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 10:32:58,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:58,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 38 proven. 80 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-04 10:32:58,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:58,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246281625] [2025-03-04 10:32:58,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246281625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:58,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982419115] [2025-03-04 10:32:58,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:58,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:58,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:58,160 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:58,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:32:58,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 10:32:58,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 10:32:58,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:58,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:58,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:32:58,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 50 proven. 84 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-04 10:32:58,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 50 proven. 87 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 10:32:58,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982419115] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:58,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:58,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 16 [2025-03-04 10:32:58,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690543867] [2025-03-04 10:32:58,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:58,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:32:58,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:58,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:32:58,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:32:58,557 INFO L87 Difference]: Start difference. First operand 98 states and 159 transitions. Second operand has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 10 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-04 10:32:58,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:58,713 INFO L93 Difference]: Finished difference Result 174 states and 299 transitions. [2025-03-04 10:32:58,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:32:58,713 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 10 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) Word has length 82 [2025-03-04 10:32:58,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:58,714 INFO L225 Difference]: With dead ends: 174 [2025-03-04 10:32:58,714 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 10:32:58,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 157 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:32:58,719 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 101 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:58,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 65 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:58,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 10:32:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2025-03-04 10:32:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 53 states have internal predecessors, (61), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (26), 12 states have call predecessors, (26), 6 states have call successors, (26) [2025-03-04 10:32:58,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 94 transitions. [2025-03-04 10:32:58,733 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 94 transitions. Word has length 82 [2025-03-04 10:32:58,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:58,733 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 94 transitions. [2025-03-04 10:32:58,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 10 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-04 10:32:58,733 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2025-03-04 10:32:58,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-04 10:32:58,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:58,739 INFO L218 NwaCegarLoop]: trace histogram [19, 17, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 4, 1, 1, 1, 1, 1] [2025-03-04 10:32:58,745 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-04 10:32:58,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:58,940 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:58,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:58,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1159880617, now seen corresponding path program 2 times [2025-03-04 10:32:58,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:58,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029213427] [2025-03-04 10:32:58,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:58,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:58,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 177 statements into 2 equivalence classes. [2025-03-04 10:32:58,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 10:32:58,975 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:58,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1048 backedges. 93 proven. 429 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2025-03-04 10:32:59,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:59,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029213427] [2025-03-04 10:32:59,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029213427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:59,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782226344] [2025-03-04 10:32:59,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:59,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:59,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:59,237 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:59,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:32:59,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 177 statements into 2 equivalence classes. [2025-03-04 10:32:59,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 10:32:59,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:59,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:59,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:32:59,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:59,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1048 backedges. 615 proven. 183 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-04 10:32:59,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1048 backedges. 109 proven. 501 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2025-03-04 10:32:59,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782226344] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:59,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:59,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 19 [2025-03-04 10:32:59,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828591664] [2025-03-04 10:32:59,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:59,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:32:59,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:59,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:32:59,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:32:59,845 INFO L87 Difference]: Start difference. First operand 70 states and 94 transitions. Second operand has 19 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 14 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) [2025-03-04 10:33:00,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:00,027 INFO L93 Difference]: Finished difference Result 173 states and 254 transitions. [2025-03-04 10:33:00,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:33:00,027 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 14 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) Word has length 177 [2025-03-04 10:33:00,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:00,028 INFO L225 Difference]: With dead ends: 173 [2025-03-04 10:33:00,028 INFO L226 Difference]: Without dead ends: 107 [2025-03-04 10:33:00,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 345 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:33:00,030 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 164 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:00,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 84 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:00,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-04 10:33:00,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2025-03-04 10:33:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.12) internal successors, (84), 73 states have internal predecessors, (84), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (36), 15 states have call predecessors, (36), 9 states have call successors, (36) [2025-03-04 10:33:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 130 transitions. [2025-03-04 10:33:00,038 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 130 transitions. Word has length 177 [2025-03-04 10:33:00,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:00,038 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 130 transitions. [2025-03-04 10:33:00,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 14 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) [2025-03-04 10:33:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 130 transitions. [2025-03-04 10:33:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 10:33:00,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:00,041 INFO L218 NwaCegarLoop]: trace histogram [10, 8, 8, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 10:33:00,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:00,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:00,242 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:00,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:00,242 INFO L85 PathProgramCache]: Analyzing trace with hash 391603619, now seen corresponding path program 3 times [2025-03-04 10:33:00,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:00,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940099394] [2025-03-04 10:33:00,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:00,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:00,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 8 equivalence classes. [2025-03-04 10:33:00,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 51 of 90 statements. [2025-03-04 10:33:00,256 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 10:33:00,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 58 proven. 8 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-04 10:33:00,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:00,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940099394] [2025-03-04 10:33:00,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940099394] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:00,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279589073] [2025-03-04 10:33:00,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:00,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:00,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:00,363 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:00,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:33:00,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 8 equivalence classes. [2025-03-04 10:33:00,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 51 of 90 statements. [2025-03-04 10:33:00,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 10:33:00,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:00,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:33:00,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:00,455 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-03-04 10:33:00,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:00,591 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-03-04 10:33:00,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279589073] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:00,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:00,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-03-04 10:33:00,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158149460] [2025-03-04 10:33:00,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:00,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:33:00,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:00,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:33:00,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:33:00,593 INFO L87 Difference]: Start difference. First operand 95 states and 130 transitions. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 10:33:00,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:00,643 INFO L93 Difference]: Finished difference Result 101 states and 137 transitions. [2025-03-04 10:33:00,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:33:00,644 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) Word has length 90 [2025-03-04 10:33:00,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:00,645 INFO L225 Difference]: With dead ends: 101 [2025-03-04 10:33:00,645 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 10:33:00,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 168 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:33:00,645 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:00,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 92 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 10:33:00,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2025-03-04 10:33:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 72 states have internal predecessors, (82), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (36), 15 states have call predecessors, (36), 9 states have call successors, (36) [2025-03-04 10:33:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 128 transitions. [2025-03-04 10:33:00,653 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 128 transitions. Word has length 90 [2025-03-04 10:33:00,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:00,653 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 128 transitions. [2025-03-04 10:33:00,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 10:33:00,653 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 128 transitions. [2025-03-04 10:33:00,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 10:33:00,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:00,654 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 10:33:00,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:00,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:00,855 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:00,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:00,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1395088361, now seen corresponding path program 2 times [2025-03-04 10:33:00,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:00,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89304953] [2025-03-04 10:33:00,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:00,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:00,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-03-04 10:33:00,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 10:33:00,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:00,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:00,901 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-04 10:33:00,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:00,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89304953] [2025-03-04 10:33:00,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89304953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:00,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:00,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:33:00,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480046483] [2025-03-04 10:33:00,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:00,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:33:00,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:00,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:33:00,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:33:00,902 INFO L87 Difference]: Start difference. First operand 94 states and 128 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:33:00,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:00,916 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2025-03-04 10:33:00,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:33:00,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 85 [2025-03-04 10:33:00,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:00,918 INFO L225 Difference]: With dead ends: 101 [2025-03-04 10:33:00,918 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 10:33:00,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:33:00,918 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:00,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 68 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 10:33:00,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2025-03-04 10:33:00,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 72 states have internal predecessors, (82), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (36), 15 states have call predecessors, (36), 9 states have call successors, (36) [2025-03-04 10:33:00,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 128 transitions. [2025-03-04 10:33:00,930 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 128 transitions. Word has length 85 [2025-03-04 10:33:00,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:00,931 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 128 transitions. [2025-03-04 10:33:00,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:33:00,931 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 128 transitions. [2025-03-04 10:33:00,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 10:33:00,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:00,932 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 8, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:00,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:33:00,933 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:00,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash 113570571, now seen corresponding path program 3 times [2025-03-04 10:33:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:00,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384956317] [2025-03-04 10:33:00,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:00,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:00,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 8 equivalence classes. [2025-03-04 10:33:00,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 80 of 92 statements. [2025-03-04 10:33:00,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 10:33:00,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 101 proven. 48 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-04 10:33:01,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:01,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384956317] [2025-03-04 10:33:01,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384956317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:01,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935448622] [2025-03-04 10:33:01,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:01,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:01,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:01,058 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:01,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:33:01,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 8 equivalence classes. [2025-03-04 10:33:01,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 80 of 92 statements. [2025-03-04 10:33:01,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 10:33:01,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:01,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:33:01,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 10:33:01,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 20 proven. 66 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 10:33:01,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935448622] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:01,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:01,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 32 [2025-03-04 10:33:01,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508326789] [2025-03-04 10:33:01,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:01,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 10:33:01,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:01,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 10:33:01,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:33:01,883 INFO L87 Difference]: Start difference. First operand 94 states and 128 transitions. Second operand has 32 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 12 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (22), 19 states have call predecessors, (22), 12 states have call successors, (22) [2025-03-04 10:33:02,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:02,716 INFO L93 Difference]: Finished difference Result 250 states and 418 transitions. [2025-03-04 10:33:02,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-04 10:33:02,717 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 12 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (22), 19 states have call predecessors, (22), 12 states have call successors, (22) Word has length 92 [2025-03-04 10:33:02,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:02,718 INFO L225 Difference]: With dead ends: 250 [2025-03-04 10:33:02,718 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 10:33:02,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 168 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1020, Invalid=3950, Unknown=0, NotChecked=0, Total=4970 [2025-03-04 10:33:02,721 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 290 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:02,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 118 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:33:02,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 10:33:02,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 121. [2025-03-04 10:33:02,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 93 states have internal predecessors, (100), 13 states have call successors, (13), 7 states have call predecessors, (13), 11 states have return successors, (70), 20 states have call predecessors, (70), 12 states have call successors, (70) [2025-03-04 10:33:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 183 transitions. [2025-03-04 10:33:02,739 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 183 transitions. Word has length 92 [2025-03-04 10:33:02,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:02,740 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 183 transitions. [2025-03-04 10:33:02,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 12 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (22), 19 states have call predecessors, (22), 12 states have call successors, (22) [2025-03-04 10:33:02,741 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 183 transitions. [2025-03-04 10:33:02,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-04 10:33:02,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:02,743 INFO L218 NwaCegarLoop]: trace histogram [39, 38, 28, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 11, 9, 1, 1, 1, 1, 1] [2025-03-04 10:33:02,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:02,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 10:33:02,945 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:02,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:02,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1169766018, now seen corresponding path program 4 times [2025-03-04 10:33:02,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:02,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756354410] [2025-03-04 10:33:02,945 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:02,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:02,955 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 376 statements into 2 equivalence classes. [2025-03-04 10:33:02,967 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 222 of 376 statements. [2025-03-04 10:33:02,967 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:33:02,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4976 backedges. 127 proven. 760 refuted. 0 times theorem prover too weak. 4089 trivial. 0 not checked. [2025-03-04 10:33:03,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:03,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756354410] [2025-03-04 10:33:03,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756354410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:03,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087772142] [2025-03-04 10:33:03,088 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:03,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:03,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:03,090 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:03,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:33:03,137 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 376 statements into 2 equivalence classes. [2025-03-04 10:33:03,170 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 222 of 376 statements. [2025-03-04 10:33:03,170 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:33:03,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:03,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:33:03,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4976 backedges. 1236 proven. 15 refuted. 0 times theorem prover too weak. 3725 trivial. 0 not checked. [2025-03-04 10:33:03,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:03,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4976 backedges. 130 proven. 885 refuted. 0 times theorem prover too weak. 3961 trivial. 0 not checked. [2025-03-04 10:33:03,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087772142] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:03,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:03,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14 [2025-03-04 10:33:03,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450969124] [2025-03-04 10:33:03,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:03,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:33:03,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:03,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:33:03,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:33:03,768 INFO L87 Difference]: Start difference. First operand 121 states and 183 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 10:33:03,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:03,837 INFO L93 Difference]: Finished difference Result 218 states and 363 transitions. [2025-03-04 10:33:03,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:33:03,837 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) Word has length 376 [2025-03-04 10:33:03,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:03,838 INFO L225 Difference]: With dead ends: 218 [2025-03-04 10:33:03,838 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 10:33:03,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 744 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:33:03,841 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:03,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 70 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:03,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 10:33:03,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2025-03-04 10:33:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.0375) internal successors, (83), 78 states have internal predecessors, (83), 11 states have call successors, (11), 6 states have call predecessors, (11), 9 states have return successors, (47), 16 states have call predecessors, (47), 10 states have call successors, (47) [2025-03-04 10:33:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2025-03-04 10:33:03,852 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 376 [2025-03-04 10:33:03,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:03,853 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2025-03-04 10:33:03,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 10:33:03,853 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2025-03-04 10:33:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-04 10:33:03,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:03,858 INFO L218 NwaCegarLoop]: trace histogram [45, 43, 36, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 20, 14, 9, 1, 1, 1, 1, 1] [2025-03-04 10:33:03,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:04,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 10:33:04,059 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:04,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:04,059 INFO L85 PathProgramCache]: Analyzing trace with hash 91075625, now seen corresponding path program 5 times [2025-03-04 10:33:04,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:04,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895212234] [2025-03-04 10:33:04,060 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:04,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:04,074 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 433 statements into 34 equivalence classes. [2025-03-04 10:33:04,091 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) and asserted 213 of 433 statements. [2025-03-04 10:33:04,091 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2025-03-04 10:33:04,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6663 backedges. 881 proven. 1067 refuted. 0 times theorem prover too weak. 4715 trivial. 0 not checked. [2025-03-04 10:33:04,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:04,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895212234] [2025-03-04 10:33:04,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895212234] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:04,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414773904] [2025-03-04 10:33:04,325 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:04,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:04,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:04,327 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:04,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:33:04,375 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 433 statements into 34 equivalence classes. [2025-03-04 10:33:04,409 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) and asserted 213 of 433 statements. [2025-03-04 10:33:04,410 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2025-03-04 10:33:04,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:04,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:33:04,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6663 backedges. 885 proven. 1061 refuted. 0 times theorem prover too weak. 4717 trivial. 0 not checked. [2025-03-04 10:33:04,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6663 backedges. 883 proven. 1079 refuted. 0 times theorem prover too weak. 4701 trivial. 0 not checked. [2025-03-04 10:33:05,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414773904] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:05,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:05,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 16] total 22 [2025-03-04 10:33:05,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890939036] [2025-03-04 10:33:05,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:05,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:33:05,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:05,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:33:05,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:33:05,300 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand has 22 states, 22 states have (on average 5.045454545454546) internal successors, (111), 22 states have internal predecessors, (111), 13 states have call successors, (19), 1 states have call predecessors, (19), 7 states have return successors, (21), 11 states have call predecessors, (21), 13 states have call successors, (21) [2025-03-04 10:33:05,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:05,537 INFO L93 Difference]: Finished difference Result 221 states and 334 transitions. [2025-03-04 10:33:05,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:33:05,538 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.045454545454546) internal successors, (111), 22 states have internal predecessors, (111), 13 states have call successors, (19), 1 states have call predecessors, (19), 7 states have return successors, (21), 11 states have call predecessors, (21), 13 states have call successors, (21) Word has length 433 [2025-03-04 10:33:05,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:05,539 INFO L225 Difference]: With dead ends: 221 [2025-03-04 10:33:05,539 INFO L226 Difference]: Without dead ends: 126 [2025-03-04 10:33:05,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 897 GetRequests, 856 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=368, Invalid=892, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:33:05,541 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 148 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:05,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 113 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:05,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-04 10:33:05,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2025-03-04 10:33:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 85 states have internal predecessors, (92), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (44), 16 states have call predecessors, (44), 11 states have call successors, (44) [2025-03-04 10:33:05,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 148 transitions. [2025-03-04 10:33:05,566 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 148 transitions. Word has length 433 [2025-03-04 10:33:05,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:05,566 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 148 transitions. [2025-03-04 10:33:05,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.045454545454546) internal successors, (111), 22 states have internal predecessors, (111), 13 states have call successors, (19), 1 states have call predecessors, (19), 7 states have return successors, (21), 11 states have call predecessors, (21), 13 states have call successors, (21) [2025-03-04 10:33:05,566 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions. [2025-03-04 10:33:05,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-03-04 10:33:05,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:05,571 INFO L218 NwaCegarLoop]: trace histogram [42, 39, 33, 21, 21, 21, 21, 20, 20, 20, 20, 20, 19, 19, 19, 18, 12, 9, 1, 1, 1, 1, 1] [2025-03-04 10:33:05,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:05,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:33:05,775 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:05,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:05,776 INFO L85 PathProgramCache]: Analyzing trace with hash -154895254, now seen corresponding path program 6 times [2025-03-04 10:33:05,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:05,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763566007] [2025-03-04 10:33:05,776 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:33:05,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:05,789 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 399 statements into 27 equivalence classes. [2025-03-04 10:33:05,808 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) and asserted 241 of 399 statements. [2025-03-04 10:33:05,808 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2025-03-04 10:33:05,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5635 backedges. 1220 proven. 79 refuted. 0 times theorem prover too weak. 4336 trivial. 0 not checked. [2025-03-04 10:33:05,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:05,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763566007] [2025-03-04 10:33:05,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763566007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:05,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454435917] [2025-03-04 10:33:05,980 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:33:05,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:05,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:05,982 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:05,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:33:06,031 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 399 statements into 27 equivalence classes. [2025-03-04 10:33:06,075 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) and asserted 241 of 399 statements. [2025-03-04 10:33:06,075 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2025-03-04 10:33:06,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:06,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:33:06,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5635 backedges. 1353 proven. 97 refuted. 0 times theorem prover too weak. 4185 trivial. 0 not checked. [2025-03-04 10:33:06,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5635 backedges. 1353 proven. 106 refuted. 0 times theorem prover too weak. 4176 trivial. 0 not checked. [2025-03-04 10:33:06,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454435917] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:06,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:06,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 13] total 20 [2025-03-04 10:33:06,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960364951] [2025-03-04 10:33:06,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:06,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:33:06,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:06,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:33:06,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:33:06,777 INFO L87 Difference]: Start difference. First operand 110 states and 148 transitions. Second operand has 20 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 10 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (19), 10 states have call predecessors, (19), 10 states have call successors, (19) [2025-03-04 10:33:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:06,908 INFO L93 Difference]: Finished difference Result 207 states and 288 transitions. [2025-03-04 10:33:06,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:33:06,908 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 10 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (19), 10 states have call predecessors, (19), 10 states have call successors, (19) Word has length 399 [2025-03-04 10:33:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:06,909 INFO L225 Difference]: With dead ends: 207 [2025-03-04 10:33:06,909 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 10:33:06,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 786 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:33:06,911 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 61 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:06,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 123 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 10:33:06,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2025-03-04 10:33:06,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 74 states have (on average 1.054054054054054) internal successors, (78), 71 states have internal predecessors, (78), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (21), 12 states have call predecessors, (21), 9 states have call successors, (21) [2025-03-04 10:33:06,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2025-03-04 10:33:06,921 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 399 [2025-03-04 10:33:06,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:06,921 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2025-03-04 10:33:06,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 10 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (19), 10 states have call predecessors, (19), 10 states have call successors, (19) [2025-03-04 10:33:06,922 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2025-03-04 10:33:06,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-04 10:33:06,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:06,924 INFO L218 NwaCegarLoop]: trace histogram [31, 30, 25, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 10, 6, 1, 1, 1, 1, 1] [2025-03-04 10:33:06,929 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-04 10:33:07,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:33:07,128 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:07,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:07,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1765788247, now seen corresponding path program 7 times [2025-03-04 10:33:07,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:07,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147174071] [2025-03-04 10:33:07,129 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:33:07,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:07,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-04 10:33:07,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-04 10:33:07,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:07,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 484 proven. 1076 refuted. 0 times theorem prover too weak. 1590 trivial. 0 not checked. [2025-03-04 10:33:07,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:07,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147174071] [2025-03-04 10:33:07,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147174071] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:07,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723324049] [2025-03-04 10:33:07,476 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:33:07,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:07,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:07,479 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:07,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:33:07,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-04 10:33:07,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-04 10:33:07,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:07,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:07,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:33:07,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 569 proven. 1181 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2025-03-04 10:33:07,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 569 proven. 1253 refuted. 0 times theorem prover too weak. 1328 trivial. 0 not checked. [2025-03-04 10:33:08,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723324049] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:08,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:08,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 23] total 28 [2025-03-04 10:33:08,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345362099] [2025-03-04 10:33:08,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:08,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 10:33:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:08,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 10:33:08,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:33:08,892 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand has 28 states, 28 states have (on average 5.357142857142857) internal successors, (150), 28 states have internal predecessors, (150), 21 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (32), 13 states have call predecessors, (32), 21 states have call successors, (32) [2025-03-04 10:33:09,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:09,202 INFO L93 Difference]: Finished difference Result 230 states and 305 transitions. [2025-03-04 10:33:09,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 10:33:09,202 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.357142857142857) internal successors, (150), 28 states have internal predecessors, (150), 21 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (32), 13 states have call predecessors, (32), 21 states have call successors, (32) Word has length 301 [2025-03-04 10:33:09,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:09,204 INFO L225 Difference]: With dead ends: 230 [2025-03-04 10:33:09,204 INFO L226 Difference]: Without dead ends: 144 [2025-03-04 10:33:09,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 587 SyntacticMatches, 11 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=604, Invalid=1748, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 10:33:09,205 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 245 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:09,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 155 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:09,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-04 10:33:09,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 122. [2025-03-04 10:33:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 95 states have internal predecessors, (104), 14 states have call successors, (14), 11 states have call predecessors, (14), 8 states have return successors, (32), 15 states have call predecessors, (32), 13 states have call successors, (32) [2025-03-04 10:33:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 150 transitions. [2025-03-04 10:33:09,211 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 150 transitions. Word has length 301 [2025-03-04 10:33:09,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:09,212 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 150 transitions. [2025-03-04 10:33:09,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.357142857142857) internal successors, (150), 28 states have internal predecessors, (150), 21 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (32), 13 states have call predecessors, (32), 21 states have call successors, (32) [2025-03-04 10:33:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 150 transitions. [2025-03-04 10:33:09,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-04 10:33:09,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:09,213 INFO L218 NwaCegarLoop]: trace histogram [31, 30, 25, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 10, 6, 1, 1, 1, 1, 1] [2025-03-04 10:33:09,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:33:09,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:33:09,414 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:09,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:09,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1516920379, now seen corresponding path program 8 times [2025-03-04 10:33:09,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:09,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402319559] [2025-03-04 10:33:09,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:09,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:09,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 301 statements into 2 equivalence classes. [2025-03-04 10:33:09,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 301 of 301 statements. [2025-03-04 10:33:09,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:09,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 522 proven. 990 refuted. 0 times theorem prover too weak. 1638 trivial. 0 not checked. [2025-03-04 10:33:09,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:09,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402319559] [2025-03-04 10:33:09,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402319559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:09,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773619789] [2025-03-04 10:33:09,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:09,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:09,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:09,699 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:09,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:33:09,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 301 statements into 2 equivalence classes. [2025-03-04 10:33:09,801 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 301 of 301 statements. [2025-03-04 10:33:09,801 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:09,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:09,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:33:09,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 1787 proven. 484 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2025-03-04 10:33:09,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 517 proven. 1101 refuted. 0 times theorem prover too weak. 1532 trivial. 0 not checked. [2025-03-04 10:33:10,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773619789] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:10,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:10,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 19] total 24 [2025-03-04 10:33:10,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664505860] [2025-03-04 10:33:10,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:10,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:33:10,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:10,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:33:10,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:33:10,901 INFO L87 Difference]: Start difference. First operand 122 states and 150 transitions. Second operand has 24 states, 24 states have (on average 5.625) internal successors, (135), 24 states have internal predecessors, (135), 18 states have call successors, (23), 2 states have call predecessors, (23), 10 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) [2025-03-04 10:33:11,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:11,138 INFO L93 Difference]: Finished difference Result 235 states and 300 transitions. [2025-03-04 10:33:11,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:33:11,138 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.625) internal successors, (135), 24 states have internal predecessors, (135), 18 states have call successors, (23), 2 states have call predecessors, (23), 10 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) Word has length 301 [2025-03-04 10:33:11,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:11,139 INFO L225 Difference]: With dead ends: 235 [2025-03-04 10:33:11,140 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 10:33:11,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 589 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=349, Invalid=911, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:33:11,141 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 97 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:11,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 180 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:11,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 10:33:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 107. [2025-03-04 10:33:11,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 84 states have internal predecessors, (89), 13 states have call successors, (13), 10 states have call predecessors, (13), 7 states have return successors, (26), 12 states have call predecessors, (26), 12 states have call successors, (26) [2025-03-04 10:33:11,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2025-03-04 10:33:11,147 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 301 [2025-03-04 10:33:11,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:11,148 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2025-03-04 10:33:11,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.625) internal successors, (135), 24 states have internal predecessors, (135), 18 states have call successors, (23), 2 states have call predecessors, (23), 10 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) [2025-03-04 10:33:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2025-03-04 10:33:11,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2025-03-04 10:33:11,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:11,151 INFO L218 NwaCegarLoop]: trace histogram [77, 75, 62, 38, 38, 38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 36, 24, 15, 1, 1, 1, 1, 1] [2025-03-04 10:33:11,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:11,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:33:11,356 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:11,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:11,356 INFO L85 PathProgramCache]: Analyzing trace with hash 130488947, now seen corresponding path program 9 times [2025-03-04 10:33:11,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:11,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148629730] [2025-03-04 10:33:11,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:11,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:11,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 747 statements into 58 equivalence classes. [2025-03-04 10:33:11,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) and asserted 503 of 747 statements. [2025-03-04 10:33:11,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2025-03-04 10:33:11,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 20212 backedges. 6070 proven. 2318 refuted. 0 times theorem prover too weak. 11824 trivial. 0 not checked. [2025-03-04 10:33:13,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:13,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148629730] [2025-03-04 10:33:13,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148629730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:13,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790577175] [2025-03-04 10:33:13,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:13,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:13,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:13,750 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:13,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:33:13,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 747 statements into 58 equivalence classes. [2025-03-04 10:33:13,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) and asserted 503 of 747 statements. [2025-03-04 10:33:13,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2025-03-04 10:33:13,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:13,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-03-04 10:33:13,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 20212 backedges. 6012 proven. 1736 refuted. 0 times theorem prover too weak. 12464 trivial. 0 not checked. [2025-03-04 10:33:14,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 20212 backedges. 6479 proven. 1574 refuted. 0 times theorem prover too weak. 12159 trivial. 0 not checked. [2025-03-04 10:33:21,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790577175] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:21,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:21,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 32] total 46 [2025-03-04 10:33:21,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001750121] [2025-03-04 10:33:21,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:21,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-04 10:33:21,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:21,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-04 10:33:21,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=1667, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 10:33:21,406 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 47 states, 46 states have (on average 2.847826086956522) internal successors, (131), 47 states have internal predecessors, (131), 12 states have call successors, (14), 1 states have call predecessors, (14), 14 states have return successors, (34), 33 states have call predecessors, (34), 12 states have call successors, (34) [2025-03-04 10:33:21,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:21,630 INFO L93 Difference]: Finished difference Result 168 states and 240 transitions. [2025-03-04 10:33:21,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 10:33:21,630 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.847826086956522) internal successors, (131), 47 states have internal predecessors, (131), 12 states have call successors, (14), 1 states have call predecessors, (14), 14 states have return successors, (34), 33 states have call predecessors, (34), 12 states have call successors, (34) Word has length 747 [2025-03-04 10:33:21,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:21,632 INFO L225 Difference]: With dead ends: 168 [2025-03-04 10:33:21,632 INFO L226 Difference]: Without dead ends: 167 [2025-03-04 10:33:21,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1601 GetRequests, 1480 SyntacticMatches, 68 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2942 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=663, Invalid=2307, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 10:33:21,633 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:21,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 227 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:21,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-04 10:33:21,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 143. [2025-03-04 10:33:21,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 114 states have (on average 1.0263157894736843) internal successors, (117), 112 states have internal predecessors, (117), 17 states have call successors, (17), 10 states have call predecessors, (17), 11 states have return successors, (70), 20 states have call predecessors, (70), 16 states have call successors, (70) [2025-03-04 10:33:21,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 204 transitions. [2025-03-04 10:33:21,641 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 204 transitions. Word has length 747 [2025-03-04 10:33:21,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:21,642 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 204 transitions. [2025-03-04 10:33:21,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.847826086956522) internal successors, (131), 47 states have internal predecessors, (131), 12 states have call successors, (14), 1 states have call predecessors, (14), 14 states have return successors, (34), 33 states have call predecessors, (34), 12 states have call successors, (34) [2025-03-04 10:33:21,642 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2025-03-04 10:33:21,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 910 [2025-03-04 10:33:21,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:21,646 INFO L218 NwaCegarLoop]: trace histogram [93, 92, 75, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 45, 29, 18, 1, 1, 1, 1, 1] [2025-03-04 10:33:21,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:33:21,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:21,847 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:21,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:21,847 INFO L85 PathProgramCache]: Analyzing trace with hash 975038871, now seen corresponding path program 10 times [2025-03-04 10:33:21,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:21,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955998828] [2025-03-04 10:33:21,848 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:21,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:21,863 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 909 statements into 2 equivalence classes. [2025-03-04 10:33:21,892 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 539 of 909 statements. [2025-03-04 10:33:21,893 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:33:21,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 30053 backedges. 1430 proven. 5737 refuted. 0 times theorem prover too weak. 22886 trivial. 0 not checked. [2025-03-04 10:33:22,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:22,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955998828] [2025-03-04 10:33:22,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955998828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:22,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155806150] [2025-03-04 10:33:22,296 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:22,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:22,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:22,298 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:22,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:33:22,476 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 909 statements into 2 equivalence classes. [2025-03-04 10:33:22,562 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 539 of 909 statements. [2025-03-04 10:33:22,562 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:33:22,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:22,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 1128 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 10:33:22,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 30053 backedges. 1688 proven. 6747 refuted. 0 times theorem prover too weak. 21618 trivial. 0 not checked. [2025-03-04 10:33:22,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 30053 backedges. 1688 proven. 6862 refuted. 0 times theorem prover too weak. 21503 trivial. 0 not checked. [2025-03-04 10:33:24,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155806150] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:24,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:24,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 27] total 32 [2025-03-04 10:33:24,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027079939] [2025-03-04 10:33:24,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:24,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 10:33:24,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:24,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 10:33:24,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:33:24,803 INFO L87 Difference]: Start difference. First operand 143 states and 204 transitions. Second operand has 32 states, 32 states have (on average 5.6875) internal successors, (182), 32 states have internal predecessors, (182), 26 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (40), 16 states have call predecessors, (40), 26 states have call successors, (40) [2025-03-04 10:33:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:25,230 INFO L93 Difference]: Finished difference Result 347 states and 572 transitions. [2025-03-04 10:33:25,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 10:33:25,232 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.6875) internal successors, (182), 32 states have internal predecessors, (182), 26 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (40), 16 states have call predecessors, (40), 26 states have call successors, (40) Word has length 909 [2025-03-04 10:33:25,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:25,234 INFO L225 Difference]: With dead ends: 347 [2025-03-04 10:33:25,234 INFO L226 Difference]: Without dead ends: 210 [2025-03-04 10:33:25,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1870 GetRequests, 1801 SyntacticMatches, 13 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=824, Invalid=2482, Unknown=0, NotChecked=0, Total=3306 [2025-03-04 10:33:25,237 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 390 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:25,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 195 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:25,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-04 10:33:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 194. [2025-03-04 10:33:25,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 156 states have (on average 1.0320512820512822) internal successors, (161), 152 states have internal predecessors, (161), 23 states have call successors, (23), 14 states have call predecessors, (23), 14 states have return successors, (90), 27 states have call predecessors, (90), 22 states have call successors, (90) [2025-03-04 10:33:25,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 274 transitions. [2025-03-04 10:33:25,248 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 274 transitions. Word has length 909 [2025-03-04 10:33:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:25,248 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 274 transitions. [2025-03-04 10:33:25,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.6875) internal successors, (182), 32 states have internal predecessors, (182), 26 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (40), 16 states have call predecessors, (40), 26 states have call successors, (40) [2025-03-04 10:33:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 274 transitions. [2025-03-04 10:33:25,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1362 [2025-03-04 10:33:25,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:25,257 INFO L218 NwaCegarLoop]: trace histogram [140, 137, 113, 70, 70, 70, 70, 69, 69, 69, 69, 69, 68, 68, 68, 67, 43, 27, 1, 1, 1, 1, 1] [2025-03-04 10:33:25,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:33:25,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:25,458 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:25,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:25,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1317329016, now seen corresponding path program 11 times [2025-03-04 10:33:25,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:25,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726720863] [2025-03-04 10:33:25,458 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:25,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:25,479 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1361 statements into 98 equivalence classes. [2025-03-04 10:33:25,565 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 62 check-sat command(s) and asserted 820 of 1361 statements. [2025-03-04 10:33:25,566 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 62 check-sat command(s) [2025-03-04 10:33:25,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 67883 backedges. 7793 proven. 6466 refuted. 0 times theorem prover too weak. 53624 trivial. 0 not checked. [2025-03-04 10:33:26,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:26,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726720863] [2025-03-04 10:33:26,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726720863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:26,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683489104] [2025-03-04 10:33:26,413 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:26,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:26,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:26,414 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:26,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:33:26,592 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1361 statements into 98 equivalence classes. [2025-03-04 10:33:26,752 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 62 check-sat command(s) and asserted 820 of 1361 statements. [2025-03-04 10:33:26,753 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 62 check-sat command(s) [2025-03-04 10:33:26,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:26,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 1516 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 10:33:26,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:26,920 INFO L134 CoverageAnalysis]: Checked inductivity of 67883 backedges. 7738 proven. 6496 refuted. 0 times theorem prover too weak. 53649 trivial. 0 not checked. [2025-03-04 10:33:26,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 67883 backedges. 7733 proven. 6643 refuted. 0 times theorem prover too weak. 53507 trivial. 0 not checked. [2025-03-04 10:33:29,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683489104] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:29,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:29,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 30] total 37 [2025-03-04 10:33:29,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798336898] [2025-03-04 10:33:29,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:29,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 10:33:29,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:29,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 10:33:29,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 10:33:29,872 INFO L87 Difference]: Start difference. First operand 194 states and 274 transitions. Second operand has 37 states, 37 states have (on average 5.243243243243243) internal successors, (194), 37 states have internal predecessors, (194), 28 states have call successors, (31), 1 states have call predecessors, (31), 14 states have return successors, (40), 15 states have call predecessors, (40), 28 states have call successors, (40) [2025-03-04 10:33:30,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:30,373 INFO L93 Difference]: Finished difference Result 401 states and 662 transitions. [2025-03-04 10:33:30,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 10:33:30,373 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 5.243243243243243) internal successors, (194), 37 states have internal predecessors, (194), 28 states have call successors, (31), 1 states have call predecessors, (31), 14 states have return successors, (40), 15 states have call predecessors, (40), 28 states have call successors, (40) Word has length 1361 [2025-03-04 10:33:30,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:30,376 INFO L225 Difference]: With dead ends: 401 [2025-03-04 10:33:30,376 INFO L226 Difference]: Without dead ends: 213 [2025-03-04 10:33:30,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2783 GetRequests, 2705 SyntacticMatches, 14 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1060, Invalid=3230, Unknown=0, NotChecked=0, Total=4290 [2025-03-04 10:33:30,379 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 439 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:30,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 268 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:33:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-04 10:33:30,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 185. [2025-03-04 10:33:30,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 150 states have (on average 1.0333333333333334) internal successors, (155), 146 states have internal predecessors, (155), 23 states have call successors, (23), 17 states have call predecessors, (23), 11 states have return successors, (64), 21 states have call predecessors, (64), 22 states have call successors, (64) [2025-03-04 10:33:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 242 transitions. [2025-03-04 10:33:30,394 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 242 transitions. Word has length 1361 [2025-03-04 10:33:30,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:30,395 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 242 transitions. [2025-03-04 10:33:30,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.243243243243243) internal successors, (194), 37 states have internal predecessors, (194), 28 states have call successors, (31), 1 states have call predecessors, (31), 14 states have return successors, (40), 15 states have call predecessors, (40), 28 states have call successors, (40) [2025-03-04 10:33:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 242 transitions. [2025-03-04 10:33:30,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1551 [2025-03-04 10:33:30,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:30,406 INFO L218 NwaCegarLoop]: trace histogram [160, 155, 130, 81, 81, 81, 81, 78, 78, 78, 78, 78, 77, 77, 77, 76, 49, 30, 1, 1, 1, 1, 1] [2025-03-04 10:33:30,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 10:33:30,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:30,607 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:30,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:30,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1784499637, now seen corresponding path program 12 times [2025-03-04 10:33:30,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:30,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984615613] [2025-03-04 10:33:30,608 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:33:30,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:30,629 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1550 statements into 117 equivalence classes. [2025-03-04 10:33:30,756 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 82 check-sat command(s) and asserted 1020 of 1550 statements. [2025-03-04 10:33:30,756 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 82 check-sat command(s) [2025-03-04 10:33:30,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:31,394 INFO L134 CoverageAnalysis]: Checked inductivity of 88205 backedges. 8159 proven. 901 refuted. 0 times theorem prover too weak. 79145 trivial. 0 not checked. [2025-03-04 10:33:31,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:31,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984615613] [2025-03-04 10:33:31,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984615613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:31,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531648738] [2025-03-04 10:33:31,394 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:33:31,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:31,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:31,396 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:31,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:33:31,600 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1550 statements into 117 equivalence classes. [2025-03-04 10:33:31,809 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 82 check-sat command(s) and asserted 1020 of 1550 statements. [2025-03-04 10:33:31,809 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 82 check-sat command(s) [2025-03-04 10:33:31,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:31,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 1901 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:33:31,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:31,914 INFO L134 CoverageAnalysis]: Checked inductivity of 88205 backedges. 7497 proven. 826 refuted. 0 times theorem prover too weak. 79882 trivial. 0 not checked. [2025-03-04 10:33:31,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 88205 backedges. 7497 proven. 872 refuted. 0 times theorem prover too weak. 79836 trivial. 0 not checked. [2025-03-04 10:33:33,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531648738] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:33,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:33,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 17] total 24 [2025-03-04 10:33:33,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323415881] [2025-03-04 10:33:33,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:33,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:33:33,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:33,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:33:33,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:33:33,679 INFO L87 Difference]: Start difference. First operand 185 states and 242 transitions. Second operand has 24 states, 24 states have (on average 5.291666666666667) internal successors, (127), 24 states have internal predecessors, (127), 11 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (25), 17 states have call predecessors, (25), 11 states have call successors, (25) [2025-03-04 10:33:33,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:33,943 INFO L93 Difference]: Finished difference Result 374 states and 493 transitions. [2025-03-04 10:33:33,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:33:33,944 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.291666666666667) internal successors, (127), 24 states have internal predecessors, (127), 11 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (25), 17 states have call predecessors, (25), 11 states have call successors, (25) Word has length 1550 [2025-03-04 10:33:33,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:33,946 INFO L225 Difference]: With dead ends: 374 [2025-03-04 10:33:33,946 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 10:33:33,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3132 GetRequests, 3088 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=389, Invalid=1017, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 10:33:33,949 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 127 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:33,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 186 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 10:33:33,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 164. [2025-03-04 10:33:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 133 states have (on average 1.0300751879699248) internal successors, (137), 130 states have internal predecessors, (137), 21 states have call successors, (21), 17 states have call predecessors, (21), 9 states have return successors, (41), 16 states have call predecessors, (41), 20 states have call successors, (41) [2025-03-04 10:33:33,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 199 transitions. [2025-03-04 10:33:33,962 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 199 transitions. Word has length 1550 [2025-03-04 10:33:33,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:33,963 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 199 transitions. [2025-03-04 10:33:33,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.291666666666667) internal successors, (127), 24 states have internal predecessors, (127), 11 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (25), 17 states have call predecessors, (25), 11 states have call successors, (25) [2025-03-04 10:33:33,964 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 199 transitions. [2025-03-04 10:33:33,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1322 [2025-03-04 10:33:33,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:33,972 INFO L218 NwaCegarLoop]: trace histogram [135, 134, 109, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 66, 42, 26, 1, 1, 1, 1, 1] [2025-03-04 10:33:33,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:34,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:34,172 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:34,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:34,173 INFO L85 PathProgramCache]: Analyzing trace with hash 181535171, now seen corresponding path program 13 times [2025-03-04 10:33:34,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:34,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418229440] [2025-03-04 10:33:34,173 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:33:34,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:34,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1321 statements into 1 equivalence classes. [2025-03-04 10:33:34,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1321 of 1321 statements. [2025-03-04 10:33:34,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:34,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 63908 backedges. 4507 proven. 10243 refuted. 0 times theorem prover too weak. 49158 trivial. 0 not checked. [2025-03-04 10:33:35,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:35,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418229440] [2025-03-04 10:33:35,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418229440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:35,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356329514] [2025-03-04 10:33:35,985 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:33:35,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:35,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:35,986 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:35,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:33:36,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1321 statements into 1 equivalence classes. [2025-03-04 10:33:36,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1321 of 1321 statements. [2025-03-04 10:33:36,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:36,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:36,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 2460 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 10:33:36,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 63908 backedges. 5209 proven. 10902 refuted. 0 times theorem prover too weak. 47797 trivial. 0 not checked. [2025-03-04 10:33:36,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 63908 backedges. 5209 proven. 11133 refuted. 0 times theorem prover too weak. 47566 trivial. 0 not checked. [2025-03-04 10:33:40,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356329514] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:40,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:40,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 35] total 40 [2025-03-04 10:33:40,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191633482] [2025-03-04 10:33:40,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:40,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 10:33:40,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:40,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 10:33:40,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1309, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 10:33:40,428 INFO L87 Difference]: Start difference. First operand 164 states and 199 transitions. Second operand has 40 states, 40 states have (on average 5.55) internal successors, (222), 40 states have internal predecessors, (222), 33 states have call successors, (37), 1 states have call predecessors, (37), 17 states have return successors, (50), 19 states have call predecessors, (50), 33 states have call successors, (50) [2025-03-04 10:33:41,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:41,107 INFO L93 Difference]: Finished difference Result 383 states and 522 transitions. [2025-03-04 10:33:41,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-04 10:33:41,110 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 5.55) internal successors, (222), 40 states have internal predecessors, (222), 33 states have call successors, (37), 1 states have call predecessors, (37), 17 states have return successors, (50), 19 states have call predecessors, (50), 33 states have call successors, (50) Word has length 1321 [2025-03-04 10:33:41,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:41,112 INFO L225 Difference]: With dead ends: 383 [2025-03-04 10:33:41,112 INFO L226 Difference]: Without dead ends: 225 [2025-03-04 10:33:41,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2712 GetRequests, 2621 SyntacticMatches, 17 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1360, Invalid=4340, Unknown=0, NotChecked=0, Total=5700 [2025-03-04 10:33:41,116 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 770 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:41,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 277 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:33:41,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-04 10:33:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 191. [2025-03-04 10:33:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 155 states have (on average 1.032258064516129) internal successors, (160), 152 states have internal predecessors, (160), 25 states have call successors, (25), 20 states have call predecessors, (25), 10 states have return successors, (63), 18 states have call predecessors, (63), 24 states have call successors, (63) [2025-03-04 10:33:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 248 transitions. [2025-03-04 10:33:41,129 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 248 transitions. Word has length 1321 [2025-03-04 10:33:41,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:41,129 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 248 transitions. [2025-03-04 10:33:41,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 5.55) internal successors, (222), 40 states have internal predecessors, (222), 33 states have call successors, (37), 1 states have call predecessors, (37), 17 states have return successors, (50), 19 states have call predecessors, (50), 33 states have call successors, (50) [2025-03-04 10:33:41,130 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 248 transitions. [2025-03-04 10:33:41,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 910 [2025-03-04 10:33:41,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:41,134 INFO L218 NwaCegarLoop]: trace histogram [93, 92, 75, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 45, 29, 18, 1, 1, 1, 1, 1] [2025-03-04 10:33:41,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 10:33:41,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:41,338 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:41,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:41,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1979856459, now seen corresponding path program 14 times [2025-03-04 10:33:41,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:41,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628828722] [2025-03-04 10:33:41,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:41,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:41,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 909 statements into 2 equivalence classes. [2025-03-04 10:33:41,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 909 of 909 statements. [2025-03-04 10:33:41,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:41,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 30053 backedges. 3349 proven. 5088 refuted. 0 times theorem prover too weak. 21616 trivial. 0 not checked. [2025-03-04 10:33:42,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:42,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628828722] [2025-03-04 10:33:42,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628828722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:42,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021857128] [2025-03-04 10:33:42,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:42,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:42,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:42,253 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:42,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:33:42,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 909 statements into 2 equivalence classes. [2025-03-04 10:33:42,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 909 of 909 statements. [2025-03-04 10:33:42,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:42,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:42,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 1699 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 10:33:42,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:42,739 INFO L134 CoverageAnalysis]: Checked inductivity of 30053 backedges. 3780 proven. 5527 refuted. 0 times theorem prover too weak. 20746 trivial. 0 not checked. [2025-03-04 10:33:42,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:45,441 INFO L134 CoverageAnalysis]: Checked inductivity of 30053 backedges. 3780 proven. 5699 refuted. 0 times theorem prover too weak. 20574 trivial. 0 not checked. [2025-03-04 10:33:45,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021857128] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:45,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:45,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 31] total 36 [2025-03-04 10:33:45,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413757326] [2025-03-04 10:33:45,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:45,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 10:33:45,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:45,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 10:33:45,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1041, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:33:45,443 INFO L87 Difference]: Start difference. First operand 191 states and 248 transitions. Second operand has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 29 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (44), 17 states have call predecessors, (44), 29 states have call successors, (44) [2025-03-04 10:33:45,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:45,828 INFO L93 Difference]: Finished difference Result 400 states and 539 transitions. [2025-03-04 10:33:45,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 10:33:45,829 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 29 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (44), 17 states have call predecessors, (44), 29 states have call successors, (44) Word has length 909 [2025-03-04 10:33:45,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:45,830 INFO L225 Difference]: With dead ends: 400 [2025-03-04 10:33:45,831 INFO L226 Difference]: Without dead ends: 215 [2025-03-04 10:33:45,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1867 GetRequests, 1797 SyntacticMatches, 15 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=805, Invalid=2387, Unknown=0, NotChecked=0, Total=3192 [2025-03-04 10:33:45,833 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 244 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:45,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 309 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-04 10:33:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 167. [2025-03-04 10:33:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 134 states have (on average 1.0223880597014925) internal successors, (137), 133 states have internal predecessors, (137), 22 states have call successors, (22), 16 states have call predecessors, (22), 10 states have return successors, (56), 17 states have call predecessors, (56), 21 states have call successors, (56) [2025-03-04 10:33:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 215 transitions. [2025-03-04 10:33:45,846 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 215 transitions. Word has length 909 [2025-03-04 10:33:45,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:45,847 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 215 transitions. [2025-03-04 10:33:45,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 29 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (44), 17 states have call predecessors, (44), 29 states have call successors, (44) [2025-03-04 10:33:45,847 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 215 transitions. [2025-03-04 10:33:45,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2025-03-04 10:33:45,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:45,853 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, 1] [2025-03-04 10:33:45,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:46,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:46,054 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:46,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:46,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1653235746, now seen corresponding path program 15 times [2025-03-04 10:33:46,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:46,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115983783] [2025-03-04 10:33:46,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:46,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:46,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1066 statements into 83 equivalence classes. [2025-03-04 10:33:46,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) and asserted 1060 of 1066 statements. [2025-03-04 10:33:46,149 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2025-03-04 10:33:46,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 7401 proven. 9994 refuted. 0 times theorem prover too weak. 24071 trivial. 0 not checked. [2025-03-04 10:33:58,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:58,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115983783] [2025-03-04 10:33:58,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115983783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:58,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105942790] [2025-03-04 10:33:58,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:58,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:58,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:58,382 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:58,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:33:58,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1066 statements into 83 equivalence classes. [2025-03-04 10:33:58,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) and asserted 1060 of 1066 statements. [2025-03-04 10:33:58,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2025-03-04 10:33:58,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:58,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 1979 conjuncts, 217 conjuncts are in the unsatisfiable core [2025-03-04 10:33:58,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:59,561 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-04 10:33:59,561 INFO L312 TraceCheckSpWp]: Computing backward predicates...