./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Fibonacci03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci03.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be0a584ba9648c80e7a0523ff51ba530f1926c55cecd3c62f2cee05fbbff42e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:39:54,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:39:54,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:39:54,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:39:54,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:39:54,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:39:54,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:39:54,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:39:54,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:39:54,845 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:39:54,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:39:54,845 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:39:54,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:39:54,845 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:39:54,845 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:39:54,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:39:54,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:39:54,845 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:39:54,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:39:54,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:39:54,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:39:54,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:39:54,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:39:54,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:39:54,845 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:39:54,846 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:39:54,846 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:39:54,846 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:39:54,846 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:39:54,846 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:39:54,846 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:39:54,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:39:54,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:39:54,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:39:54,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:39:54,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:39:54,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:39:54,846 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:39:54,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:39:54,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:39:54,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:39:54,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:39:54,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:39:54,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:39:54,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:39:54,847 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be0a584ba9648c80e7a0523ff51ba530f1926c55cecd3c62f2cee05fbbff42e3 [2025-03-09 02:39:55,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:39:55,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:39:55,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:39:55,059 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:39:55,059 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:39:55,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci03.c [2025-03-09 02:39:56,218 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a6cd460/cda9941863de447d903ff1154f6184e5/FLAGd97eb4492 [2025-03-09 02:39:56,387 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:39:56,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci03.c [2025-03-09 02:39:56,395 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a6cd460/cda9941863de447d903ff1154f6184e5/FLAGd97eb4492 [2025-03-09 02:39:56,418 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a6cd460/cda9941863de447d903ff1154f6184e5 [2025-03-09 02:39:56,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:39:56,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:39:56,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:39:56,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:39:56,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:39:56,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:39:56" (1/1) ... [2025-03-09 02:39:56,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ea05857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:56, skipping insertion in model container [2025-03-09 02:39:56,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:39:56" (1/1) ... [2025-03-09 02:39:56,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:39:56,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:39:56,549 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:39:56,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:39:56,571 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:39:56,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:56 WrapperNode [2025-03-09 02:39:56,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:39:56,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:39:56,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:39:56,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:39:56,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:56" (1/1) ... [2025-03-09 02:39:56,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:56" (1/1) ... [2025-03-09 02:39:56,596 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2025-03-09 02:39:56,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:39:56,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:39:56,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:39:56,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:39:56,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:56" (1/1) ... [2025-03-09 02:39:56,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:56" (1/1) ... [2025-03-09 02:39:56,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:56" (1/1) ... [2025-03-09 02:39:56,613 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 02:39:56,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:56" (1/1) ... [2025-03-09 02:39:56,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:56" (1/1) ... [2025-03-09 02:39:56,617 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:56" (1/1) ... [2025-03-09 02:39:56,617 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:56" (1/1) ... [2025-03-09 02:39:56,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:56" (1/1) ... [2025-03-09 02:39:56,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:56" (1/1) ... [2025-03-09 02:39:56,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:39:56,619 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:39:56,619 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:39:56,619 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:39:56,623 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:56" (1/1) ... [2025-03-09 02:39:56,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:39:56,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:56,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:39:56,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:39:56,668 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-03-09 02:39:56,668 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-03-09 02:39:56,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:39:56,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:39:56,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:39:56,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:39:56,705 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:39:56,706 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:39:56,772 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: havoc #t~ret4;havoc #t~ret5; [2025-03-09 02:39:56,810 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-09 02:39:56,810 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:39:56,817 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:39:56,817 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:39:56,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:39:56 BoogieIcfgContainer [2025-03-09 02:39:56,819 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:39:56,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:39:56,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:39:56,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:39:56,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:39:56" (1/3) ... [2025-03-09 02:39:56,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee3c70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:39:56, skipping insertion in model container [2025-03-09 02:39:56,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:56" (2/3) ... [2025-03-09 02:39:56,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee3c70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:39:56, skipping insertion in model container [2025-03-09 02:39:56,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:39:56" (3/3) ... [2025-03-09 02:39:56,826 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci03.c [2025-03-09 02:39:56,837 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:39:56,839 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci03.c that has 2 procedures, 32 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-09 02:39:56,877 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:39:56,886 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;@2789de2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:39:56,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 02:39:56,889 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-09 02:39:56,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:39:56,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:56,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:56,894 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:39:56,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:56,898 INFO L85 PathProgramCache]: Analyzing trace with hash 154990982, now seen corresponding path program 1 times [2025-03-09 02:39:56,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:56,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211300685] [2025-03-09 02:39:56,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:56,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:56,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:39:56,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:39:56,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:56,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:57,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:57,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:57,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211300685] [2025-03-09 02:39:57,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211300685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:57,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:39:57,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:39:57,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715798776] [2025-03-09 02:39:57,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:57,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:39:57,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:57,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:39:57,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:39:57,037 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-09 02:39:57,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:57,065 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-03-09 02:39:57,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:39:57,066 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-09 02:39:57,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:57,069 INFO L225 Difference]: With dead ends: 37 [2025-03-09 02:39:57,070 INFO L226 Difference]: Without dead ends: 25 [2025-03-09 02:39:57,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:39:57,073 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-09 02:39:57,073 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-09 02:39:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-09 02:39:57,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-03-09 02:39:57,096 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-09 02:39:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-09 02:39:57,100 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 8 [2025-03-09 02:39:57,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:57,100 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-09 02:39:57,100 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-09 02:39:57,100 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-03-09 02:39:57,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 02:39:57,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:57,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:57,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:39:57,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:39:57,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:57,103 INFO L85 PathProgramCache]: Analyzing trace with hash 509753131, now seen corresponding path program 1 times [2025-03-09 02:39:57,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:57,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780073452] [2025-03-09 02:39:57,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:57,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:57,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 02:39:57,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 02:39:57,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:57,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:39:57,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:57,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780073452] [2025-03-09 02:39:57,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780073452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:57,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:39:57,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:39:57,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175566976] [2025-03-09 02:39:57,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:57,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:39:57,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:57,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:39:57,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:39:57,174 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 5 states, 3 states have (on average 2.6666666666666665) 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-09 02:39:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:57,245 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2025-03-09 02:39:57,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:39:57,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.6666666666666665) 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-09 02:39:57,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:57,246 INFO L225 Difference]: With dead ends: 25 [2025-03-09 02:39:57,246 INFO L226 Difference]: Without dead ends: 23 [2025-03-09 02:39:57,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:39:57,248 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:57,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 32 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:39:57,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-09 02:39:57,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-03-09 02:39:57,254 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-09 02:39:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-09 02:39:57,255 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 9 [2025-03-09 02:39:57,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:57,255 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-09 02:39:57,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.6666666666666665) 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-09 02:39:57,255 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-09 02:39:57,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 02:39:57,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:57,256 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:57,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:39:57,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:39:57,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash -984405394, now seen corresponding path program 1 times [2025-03-09 02:39:57,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:57,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070143735] [2025-03-09 02:39:57,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:57,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:57,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:39:57,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:39:57,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:57,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:57,394 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-09 02:39:57,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:57,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070143735] [2025-03-09 02:39:57,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070143735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:57,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:39:57,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:39:57,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371019953] [2025-03-09 02:39:57,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:57,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:39:57,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:57,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:39:57,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:39:57,399 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-09 02:39:57,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:57,438 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-03-09 02:39:57,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:39:57,440 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-09 02:39:57,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:57,440 INFO L225 Difference]: With dead ends: 35 [2025-03-09 02:39:57,440 INFO L226 Difference]: Without dead ends: 33 [2025-03-09 02:39:57,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:39:57,441 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-09 02:39:57,441 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-09 02:39:57,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-09 02:39:57,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2025-03-09 02:39:57,447 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-09 02:39:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-03-09 02:39:57,448 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 24 [2025-03-09 02:39:57,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:57,448 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-09 02:39:57,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:39:57,449 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-03-09 02:39:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-09 02:39:57,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:57,449 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:57,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:39:57,449 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:39:57,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:57,450 INFO L85 PathProgramCache]: Analyzing trace with hash -119709208, now seen corresponding path program 1 times [2025-03-09 02:39:57,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:57,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258154942] [2025-03-09 02:39:57,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:57,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:57,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 02:39:57,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 02:39:57,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:57,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 02:39:57,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:57,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258154942] [2025-03-09 02:39:57,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258154942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:57,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543954910] [2025-03-09 02:39:57,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:57,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:57,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:57,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:39:57,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:39:57,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 02:39:57,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 02:39:57,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:57,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:57,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:39:57,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:57,707 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-09 02:39:57,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:39:57,859 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-09 02:39:57,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543954910] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:39:57,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:39:57,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-09 02:39:57,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436167291] [2025-03-09 02:39:57,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:39:57,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 02:39:57,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:57,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 02:39:57,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:39:57,861 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-09 02:39:58,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:58,081 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2025-03-09 02:39:58,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 02:39:58,082 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-09 02:39:58,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:58,083 INFO L225 Difference]: With dead ends: 91 [2025-03-09 02:39:58,083 INFO L226 Difference]: Without dead ends: 65 [2025-03-09 02:39:58,084 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-09 02:39:58,085 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-09 02:39:58,085 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-09 02:39:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-09 02:39:58,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2025-03-09 02:39:58,093 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-09 02:39:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2025-03-09 02:39:58,094 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 31 [2025-03-09 02:39:58,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:58,095 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2025-03-09 02:39:58,095 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-09 02:39:58,095 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2025-03-09 02:39:58,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 02:39:58,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:58,096 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-09 02:39:58,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 02:39:58,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:58,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:39:58,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:58,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1220480843, now seen corresponding path program 2 times [2025-03-09 02:39:58,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:58,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150615780] [2025-03-09 02:39:58,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:39:58,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:58,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-09 02:39:58,309 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:39:58,310 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:39:58,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 02:39:58,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:58,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150615780] [2025-03-09 02:39:58,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150615780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:58,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656143621] [2025-03-09 02:39:58,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:39:58,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:58,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:58,395 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:39:58,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:39:58,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-09 02:39:58,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:39:58,423 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:39:58,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:58,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:39:58,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:58,469 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-09 02:39:58,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:39:58,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656143621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:58,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:39:58,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-09 02:39:58,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884175712] [2025-03-09 02:39:58,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:58,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:39:58,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:58,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:39:58,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:39:58,471 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-09 02:39:58,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:58,490 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2025-03-09 02:39:58,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:39:58,490 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-09 02:39:58,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:58,491 INFO L225 Difference]: With dead ends: 60 [2025-03-09 02:39:58,491 INFO L226 Difference]: Without dead ends: 59 [2025-03-09 02:39:58,491 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-09 02:39:58,492 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-09 02:39:58,492 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-09 02:39:58,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-09 02:39:58,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2025-03-09 02:39:58,501 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-09 02:39:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2025-03-09 02:39:58,502 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 25 [2025-03-09 02:39:58,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:58,502 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2025-03-09 02:39:58,502 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-09 02:39:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2025-03-09 02:39:58,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 02:39:58,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:58,503 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, 1] [2025-03-09 02:39:58,508 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-09 02:39:58,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:58,703 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:39:58,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:58,704 INFO L85 PathProgramCache]: Analyzing trace with hash -819799558, now seen corresponding path program 1 times [2025-03-09 02:39:58,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:58,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890357020] [2025-03-09 02:39:58,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:58,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:58,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 02:39:58,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 02:39:58,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:58,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 02:39:58,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:58,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890357020] [2025-03-09 02:39:58,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890357020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:58,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615213919] [2025-03-09 02:39:58,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:58,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:58,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:58,779 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:39:58,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:39:58,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 02:39:58,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 02:39:58,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:58,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:58,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:39:58,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:58,861 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-09 02:39:58,861 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:39:58,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615213919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:58,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:39:58,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-09 02:39:58,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980982913] [2025-03-09 02:39:58,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:58,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:39:58,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:58,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:39:58,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:39:58,862 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-09 02:39:58,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:58,889 INFO L93 Difference]: Finished difference Result 82 states and 117 transitions. [2025-03-09 02:39:58,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:39:58,890 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 26 [2025-03-09 02:39:58,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:58,891 INFO L225 Difference]: With dead ends: 82 [2025-03-09 02:39:58,891 INFO L226 Difference]: Without dead ends: 81 [2025-03-09 02:39:58,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 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-09 02:39:58,892 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-09 02:39:58,892 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-09 02:39:58,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-09 02:39:58,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2025-03-09 02:39:58,902 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-09 02:39:58,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2025-03-09 02:39:58,903 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 26 [2025-03-09 02:39:58,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:58,903 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2025-03-09 02:39:58,903 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-09 02:39:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2025-03-09 02:39:58,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-09 02:39:58,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:58,906 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:58,911 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-09 02:39:59,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:59,106 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:39:59,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:59,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1588695901, now seen corresponding path program 1 times [2025-03-09 02:39:59,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:59,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979952435] [2025-03-09 02:39:59,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:59,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:59,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 02:39:59,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 02:39:59,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:59,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-09 02:39:59,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:59,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979952435] [2025-03-09 02:39:59,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979952435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:59,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240203491] [2025-03-09 02:39:59,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:59,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:59,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:59,246 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:39:59,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:39:59,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 02:39:59,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 02:39:59,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:59,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:59,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:39:59,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:59,355 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-09 02:39:59,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:39:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 02:39:59,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240203491] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:39:59,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:39:59,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-03-09 02:39:59,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624648644] [2025-03-09 02:39:59,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:39:59,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 02:39:59,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:59,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 02:39:59,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:39:59,515 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-09 02:39:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:59,664 INFO L93 Difference]: Finished difference Result 141 states and 217 transitions. [2025-03-09 02:39:59,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 02:39:59,664 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 52 [2025-03-09 02:39:59,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:59,667 INFO L225 Difference]: With dead ends: 141 [2025-03-09 02:39:59,669 INFO L226 Difference]: Without dead ends: 139 [2025-03-09 02:39:59,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-03-09 02:39:59,670 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:59,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 177 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:39:59,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-09 02:39:59,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 98. [2025-03-09 02:39:59,692 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-09 02:39:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 159 transitions. [2025-03-09 02:39:59,696 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 159 transitions. Word has length 52 [2025-03-09 02:39:59,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:59,696 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 159 transitions. [2025-03-09 02:39:59,696 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-09 02:39:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 159 transitions. [2025-03-09 02:39:59,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 02:39:59,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:59,700 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:59,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 02:39:59,901 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-09 02:39:59,901 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:39:59,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:59,901 INFO L85 PathProgramCache]: Analyzing trace with hash 993600403, now seen corresponding path program 1 times [2025-03-09 02:39:59,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:59,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493602365] [2025-03-09 02:39:59,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:59,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:59,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 02:39:59,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 02:39:59,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:59,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-09 02:40:00,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:00,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493602365] [2025-03-09 02:40:00,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493602365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:00,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609222853] [2025-03-09 02:40:00,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:40:00,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:00,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:00,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:40:00,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 02:40:00,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 02:40:00,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 02:40:00,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:00,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:00,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:40:00,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:00,127 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-09 02:40:00,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:00,292 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-09 02:40:00,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609222853] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:00,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:00,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 5] total 18 [2025-03-09 02:40:00,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288836202] [2025-03-09 02:40:00,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:00,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 02:40:00,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:00,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 02:40:00,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-09 02:40:00,294 INFO L87 Difference]: Start difference. First operand 98 states and 159 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 7 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (14), 10 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-09 02:40:00,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:00,808 INFO L93 Difference]: Finished difference Result 257 states and 504 transitions. [2025-03-09 02:40:00,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-09 02:40:00,809 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 7 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (14), 10 states have call predecessors, (14), 7 states have call successors, (14) Word has length 63 [2025-03-09 02:40:00,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:00,810 INFO L225 Difference]: With dead ends: 257 [2025-03-09 02:40:00,810 INFO L226 Difference]: Without dead ends: 163 [2025-03-09 02:40:00,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=419, Invalid=1473, Unknown=0, NotChecked=0, Total=1892 [2025-03-09 02:40:00,813 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 91 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:00,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 106 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:40:00,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-09 02:40:00,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 103. [2025-03-09 02:40:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 12 states have call successors, (12), 3 states have call predecessors, (12), 10 states have return successors, (75), 19 states have call predecessors, (75), 11 states have call successors, (75) [2025-03-09 02:40:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 171 transitions. [2025-03-09 02:40:00,832 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 171 transitions. Word has length 63 [2025-03-09 02:40:00,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:00,832 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 171 transitions. [2025-03-09 02:40:00,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 7 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (14), 10 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-09 02:40:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 171 transitions. [2025-03-09 02:40:00,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-09 02:40:00,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:00,835 INFO L218 NwaCegarLoop]: trace histogram [14, 12, 10, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 1, 1, 1, 1, 1] [2025-03-09 02:40:00,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 02:40:01,039 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-09 02:40:01,039 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:01,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:01,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1513623466, now seen corresponding path program 2 times [2025-03-09 02:40:01,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:01,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861307592] [2025-03-09 02:40:01,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:01,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:01,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 129 statements into 2 equivalence classes. [2025-03-09 02:40:01,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 129 of 129 statements. [2025-03-09 02:40:01,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:01,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 35 proven. 126 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2025-03-09 02:40:01,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:01,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861307592] [2025-03-09 02:40:01,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861307592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:01,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479040192] [2025-03-09 02:40:01,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:01,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:01,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:01,150 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:40:01,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 02:40:01,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 129 statements into 2 equivalence classes. [2025-03-09 02:40:01,202 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 129 of 129 statements. [2025-03-09 02:40:01,202 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:01,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:01,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 02:40:01,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:01,285 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 9 proven. 130 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-09 02:40:01,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:01,617 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 9 proven. 130 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-09 02:40:01,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479040192] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:01,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:01,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-09 02:40:01,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172827494] [2025-03-09 02:40:01,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:01,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:40:01,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:01,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:40:01,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:40:01,619 INFO L87 Difference]: Start difference. First operand 103 states and 171 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 02:40:01,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:01,695 INFO L93 Difference]: Finished difference Result 162 states and 278 transitions. [2025-03-09 02:40:01,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:40:01,695 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 129 [2025-03-09 02:40:01,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:01,696 INFO L225 Difference]: With dead ends: 162 [2025-03-09 02:40:01,696 INFO L226 Difference]: Without dead ends: 63 [2025-03-09 02:40:01,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 246 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:40:01,698 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:01,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 68 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:40:01,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-09 02:40:01,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-09 02:40:01,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (26), 10 states have call predecessors, (26), 6 states have call successors, (26) [2025-03-09 02:40:01,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2025-03-09 02:40:01,706 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 129 [2025-03-09 02:40:01,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:01,707 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2025-03-09 02:40:01,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 02:40:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2025-03-09 02:40:01,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-09 02:40:01,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:01,709 INFO L218 NwaCegarLoop]: trace histogram [14, 12, 11, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 1, 1, 1, 1, 1] [2025-03-09 02:40:01,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 02:40:01,909 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-09 02:40:01,910 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:01,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:01,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1695716789, now seen corresponding path program 3 times [2025-03-09 02:40:01,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:01,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040617766] [2025-03-09 02:40:01,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:40:01,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:01,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 130 statements into 12 equivalence classes. [2025-03-09 02:40:01,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 71 of 130 statements. [2025-03-09 02:40:01,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 02:40:01,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 207 proven. 18 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-09 02:40:01,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:01,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040617766] [2025-03-09 02:40:01,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040617766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:01,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061716318] [2025-03-09 02:40:01,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:40:01,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:01,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:01,993 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:40:01,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 02:40:02,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 130 statements into 12 equivalence classes. [2025-03-09 02:40:02,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 71 of 130 statements. [2025-03-09 02:40:02,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 02:40:02,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:02,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:40:02,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 204 proven. 21 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-09 02:40:02,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 204 proven. 22 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-03-09 02:40:02,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061716318] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:02,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:02,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 12 [2025-03-09 02:40:02,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971181753] [2025-03-09 02:40:02,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:02,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:40:02,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:02,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:40:02,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:40:02,334 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 02:40:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:02,410 INFO L93 Difference]: Finished difference Result 124 states and 179 transitions. [2025-03-09 02:40:02,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:40:02,411 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 130 [2025-03-09 02:40:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:02,412 INFO L225 Difference]: With dead ends: 124 [2025-03-09 02:40:02,412 INFO L226 Difference]: Without dead ends: 65 [2025-03-09 02:40:02,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 254 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:40:02,413 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 40 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:02,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 81 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:40:02,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-09 02:40:02,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-09 02:40:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (22), 10 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-09 02:40:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2025-03-09 02:40:02,424 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 130 [2025-03-09 02:40:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:02,424 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2025-03-09 02:40:02,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 02:40:02,424 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2025-03-09 02:40:02,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-09 02:40:02,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:02,425 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 1, 1, 1, 1, 1] [2025-03-09 02:40:02,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 02:40:02,625 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-09 02:40:02,626 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:02,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:02,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1396439778, now seen corresponding path program 4 times [2025-03-09 02:40:02,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:02,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535378187] [2025-03-09 02:40:02,626 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:40:02,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:02,640 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 124 statements into 2 equivalence classes. [2025-03-09 02:40:02,645 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 73 of 124 statements. [2025-03-09 02:40:02,645 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 02:40:02,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 97 proven. 216 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-09 02:40:02,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:02,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535378187] [2025-03-09 02:40:02,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535378187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:02,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341515995] [2025-03-09 02:40:02,781 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:40:02,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:02,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:02,783 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:40:02,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 02:40:02,814 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 124 statements into 2 equivalence classes. [2025-03-09 02:40:02,826 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 73 of 124 statements. [2025-03-09 02:40:02,826 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 02:40:02,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:02,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:40:02,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 114 proven. 218 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-09 02:40:02,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:03,408 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 114 proven. 234 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-09 02:40:03,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341515995] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:03,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:03,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 20 [2025-03-09 02:40:03,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312730544] [2025-03-09 02:40:03,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:03,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 02:40:03,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:03,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 02:40:03,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-03-09 02:40:03,410 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 14 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (20), 9 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-09 02:40:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:03,603 INFO L93 Difference]: Finished difference Result 134 states and 181 transitions. [2025-03-09 02:40:03,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 02:40:03,603 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 14 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (20), 9 states have call predecessors, (20), 14 states have call successors, (20) Word has length 124 [2025-03-09 02:40:03,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:03,604 INFO L225 Difference]: With dead ends: 134 [2025-03-09 02:40:03,604 INFO L226 Difference]: Without dead ends: 73 [2025-03-09 02:40:03,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 238 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2025-03-09 02:40:03,605 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 81 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:03,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 109 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:40:03,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-09 02:40:03,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2025-03-09 02:40:03,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 48 states have internal predecessors, (53), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-09 02:40:03,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2025-03-09 02:40:03,612 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 124 [2025-03-09 02:40:03,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:03,612 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2025-03-09 02:40:03,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 14 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (20), 9 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-09 02:40:03,612 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2025-03-09 02:40:03,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-09 02:40:03,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:03,614 INFO L218 NwaCegarLoop]: trace histogram [19, 18, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 4, 1, 1, 1, 1, 1] [2025-03-09 02:40:03,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 02:40:03,815 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,SelfDestructingSolverStorable10 [2025-03-09 02:40:03,815 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:03,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:03,816 INFO L85 PathProgramCache]: Analyzing trace with hash -552937243, now seen corresponding path program 5 times [2025-03-09 02:40:03,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:03,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944884259] [2025-03-09 02:40:03,816 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:40:03,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:03,822 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 183 statements into 15 equivalence classes. [2025-03-09 02:40:03,831 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 141 of 183 statements. [2025-03-09 02:40:03,831 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-09 02:40:03,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 281 proven. 362 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2025-03-09 02:40:04,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:04,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944884259] [2025-03-09 02:40:04,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944884259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:04,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454936497] [2025-03-09 02:40:04,041 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:40:04,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:04,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:04,044 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:40:04,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 02:40:04,077 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 183 statements into 15 equivalence classes. [2025-03-09 02:40:04,100 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 141 of 183 statements. [2025-03-09 02:40:04,100 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-09 02:40:04,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:04,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:40:04,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 263 proven. 345 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2025-03-09 02:40:04,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 267 proven. 357 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2025-03-09 02:40:04,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454936497] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:04,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:04,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 15] total 21 [2025-03-09 02:40:04,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422073540] [2025-03-09 02:40:04,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:04,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 02:40:04,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:04,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 02:40:04,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-03-09 02:40:04,648 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 21 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 12 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (22), 13 states have call predecessors, (22), 12 states have call successors, (22) [2025-03-09 02:40:04,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:04,907 INFO L93 Difference]: Finished difference Result 149 states and 181 transitions. [2025-03-09 02:40:04,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 02:40:04,907 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 12 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (22), 13 states have call predecessors, (22), 12 states have call successors, (22) Word has length 183 [2025-03-09 02:40:04,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:04,908 INFO L225 Difference]: With dead ends: 149 [2025-03-09 02:40:04,908 INFO L226 Difference]: Without dead ends: 93 [2025-03-09 02:40:04,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 357 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=350, Invalid=910, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 02:40:04,909 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 150 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:04,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 124 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:40:04,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-09 02:40:04,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 80. [2025-03-09 02:40:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.0625) internal successors, (68), 62 states have internal predecessors, (68), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (17), 9 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-09 02:40:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2025-03-09 02:40:04,914 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 183 [2025-03-09 02:40:04,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:04,914 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2025-03-09 02:40:04,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 12 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (22), 13 states have call predecessors, (22), 12 states have call successors, (22) [2025-03-09 02:40:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2025-03-09 02:40:04,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-09 02:40:04,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:04,915 INFO L218 NwaCegarLoop]: trace histogram [14, 12, 11, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 1, 1, 1, 1, 1] [2025-03-09 02:40:04,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 02:40:05,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:05,120 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:05,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1715536077, now seen corresponding path program 6 times [2025-03-09 02:40:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:05,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014458114] [2025-03-09 02:40:05,120 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 02:40:05,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:05,125 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 130 statements into 9 equivalence classes. [2025-03-09 02:40:05,137 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 130 of 130 statements. [2025-03-09 02:40:05,137 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-09 02:40:05,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 183 proven. 132 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-03-09 02:40:05,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:05,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014458114] [2025-03-09 02:40:05,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014458114] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:05,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297081733] [2025-03-09 02:40:05,263 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 02:40:05,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:05,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:05,265 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:40:05,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 02:40:05,297 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 130 statements into 9 equivalence classes. [2025-03-09 02:40:05,320 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 130 of 130 statements. [2025-03-09 02:40:05,320 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-09 02:40:05,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:05,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 02:40:05,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 61 proven. 95 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 02:40:05,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 103 proven. 95 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-09 02:40:06,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297081733] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:06,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:06,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 15] total 33 [2025-03-09 02:40:06,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002126950] [2025-03-09 02:40:06,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:06,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-09 02:40:06,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:06,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-09 02:40:06,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2025-03-09 02:40:06,269 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 33 states, 33 states have (on average 3.484848484848485) internal successors, (115), 33 states have internal predecessors, (115), 11 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (25), 23 states have call predecessors, (25), 11 states have call successors, (25) [2025-03-09 02:40:06,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:06,741 INFO L93 Difference]: Finished difference Result 203 states and 265 transitions. [2025-03-09 02:40:06,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-09 02:40:06,742 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.484848484848485) internal successors, (115), 33 states have internal predecessors, (115), 11 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (25), 23 states have call predecessors, (25), 11 states have call successors, (25) Word has length 130 [2025-03-09 02:40:06,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:06,743 INFO L225 Difference]: With dead ends: 203 [2025-03-09 02:40:06,743 INFO L226 Difference]: Without dead ends: 123 [2025-03-09 02:40:06,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 231 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=501, Invalid=2469, Unknown=0, NotChecked=0, Total=2970 [2025-03-09 02:40:06,744 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 149 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:06,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 123 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:40:06,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-09 02:40:06,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 98. [2025-03-09 02:40:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 77 states have internal predecessors, (82), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (26), 12 states have call predecessors, (26), 11 states have call successors, (26) [2025-03-09 02:40:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2025-03-09 02:40:06,751 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 130 [2025-03-09 02:40:06,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:06,751 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2025-03-09 02:40:06,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.484848484848485) internal successors, (115), 33 states have internal predecessors, (115), 11 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (25), 23 states have call predecessors, (25), 11 states have call successors, (25) [2025-03-09 02:40:06,752 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2025-03-09 02:40:06,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-09 02:40:06,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:06,755 INFO L218 NwaCegarLoop]: trace histogram [49, 45, 40, 25, 25, 25, 25, 23, 23, 23, 23, 23, 22, 22, 22, 21, 15, 9, 1, 1, 1, 1, 1] [2025-03-09 02:40:06,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 02:40:06,956 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,SelfDestructingSolverStorable12 [2025-03-09 02:40:06,956 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:06,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:06,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1194404785, now seen corresponding path program 7 times [2025-03-09 02:40:06,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:06,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267025173] [2025-03-09 02:40:06,957 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 02:40:06,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:06,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-09 02:40:06,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-09 02:40:06,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:06,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:07,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7717 backedges. 593 proven. 1908 refuted. 0 times theorem prover too weak. 5216 trivial. 0 not checked. [2025-03-09 02:40:07,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:07,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267025173] [2025-03-09 02:40:07,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267025173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:07,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178987954] [2025-03-09 02:40:07,494 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 02:40:07,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:07,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:07,497 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:40:07,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 02:40:07,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-09 02:40:07,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-09 02:40:07,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:07,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:07,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 02:40:07,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7717 backedges. 4011 proven. 1274 refuted. 0 times theorem prover too weak. 2432 trivial. 0 not checked. [2025-03-09 02:40:07,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 7717 backedges. 684 proven. 2447 refuted. 0 times theorem prover too weak. 4586 trivial. 0 not checked. [2025-03-09 02:40:08,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178987954] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:08,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:08,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 21] total 26 [2025-03-09 02:40:08,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643092076] [2025-03-09 02:40:08,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:08,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 02:40:08,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:08,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 02:40:08,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2025-03-09 02:40:08,694 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand has 26 states, 26 states have (on average 6.0) internal successors, (156), 26 states have internal predecessors, (156), 21 states have call successors, (28), 4 states have call predecessors, (28), 10 states have return successors, (31), 12 states have call predecessors, (31), 19 states have call successors, (31) [2025-03-09 02:40:08,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:08,973 INFO L93 Difference]: Finished difference Result 233 states and 308 transitions. [2025-03-09 02:40:08,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 02:40:08,973 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.0) internal successors, (156), 26 states have internal predecessors, (156), 21 states have call successors, (28), 4 states have call predecessors, (28), 10 states have return successors, (31), 12 states have call predecessors, (31), 19 states have call successors, (31) Word has length 465 [2025-03-09 02:40:08,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:08,975 INFO L225 Difference]: With dead ends: 233 [2025-03-09 02:40:08,975 INFO L226 Difference]: Without dead ends: 141 [2025-03-09 02:40:08,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 915 SyntacticMatches, 13 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=568, Invalid=1502, Unknown=0, NotChecked=0, Total=2070 [2025-03-09 02:40:08,977 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 227 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:08,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 127 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:40:08,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-09 02:40:08,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2025-03-09 02:40:08,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.0625) internal successors, (102), 93 states have internal predecessors, (102), 14 states have call successors, (14), 10 states have call predecessors, (14), 8 states have return successors, (32), 15 states have call predecessors, (32), 13 states have call successors, (32) [2025-03-09 02:40:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 148 transitions. [2025-03-09 02:40:08,984 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 148 transitions. Word has length 465 [2025-03-09 02:40:08,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:08,985 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 148 transitions. [2025-03-09 02:40:08,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.0) internal successors, (156), 26 states have internal predecessors, (156), 21 states have call successors, (28), 4 states have call predecessors, (28), 10 states have return successors, (31), 12 states have call predecessors, (31), 19 states have call successors, (31) [2025-03-09 02:40:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 148 transitions. [2025-03-09 02:40:08,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-09 02:40:08,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:08,988 INFO L218 NwaCegarLoop]: trace histogram [32, 30, 26, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 10, 6, 1, 1, 1, 1, 1] [2025-03-09 02:40:08,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 02:40:09,188 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,SelfDestructingSolverStorable13 [2025-03-09 02:40:09,190 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:09,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:09,190 INFO L85 PathProgramCache]: Analyzing trace with hash -449393690, now seen corresponding path program 8 times [2025-03-09 02:40:09,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:09,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948336881] [2025-03-09 02:40:09,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:09,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:09,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 307 statements into 2 equivalence classes. [2025-03-09 02:40:09,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 307 of 307 statements. [2025-03-09 02:40:09,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:09,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:09,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3282 backedges. 554 proven. 990 refuted. 0 times theorem prover too weak. 1738 trivial. 0 not checked. [2025-03-09 02:40:09,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:09,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948336881] [2025-03-09 02:40:09,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948336881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:09,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898289094] [2025-03-09 02:40:09,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:09,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:09,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:09,497 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-09 02:40:09,499 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-09 02:40:09,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 307 statements into 2 equivalence classes. [2025-03-09 02:40:09,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 307 of 307 statements. [2025-03-09 02:40:09,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:09,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:09,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 02:40:09,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3282 backedges. 1858 proven. 484 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2025-03-09 02:40:09,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3282 backedges. 551 proven. 1101 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2025-03-09 02:40:10,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898289094] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:10,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:10,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 19] total 24 [2025-03-09 02:40:10,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210202098] [2025-03-09 02:40:10,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:10,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 02:40:10,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:10,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 02:40:10,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2025-03-09 02:40:10,813 INFO L87 Difference]: Start difference. First operand 119 states and 148 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-09 02:40:11,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:11,035 INFO L93 Difference]: Finished difference Result 232 states and 300 transitions. [2025-03-09 02:40:11,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 02:40:11,036 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 307 [2025-03-09 02:40:11,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:11,037 INFO L225 Difference]: With dead ends: 232 [2025-03-09 02:40:11,037 INFO L226 Difference]: Without dead ends: 119 [2025-03-09 02:40:11,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 601 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=349, Invalid=911, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 02:40:11,038 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 107 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:11,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 154 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:40:11,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-09 02:40:11,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 107. [2025-03-09 02:40:11,045 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-09 02:40:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2025-03-09 02:40:11,045 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 307 [2025-03-09 02:40:11,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:11,046 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2025-03-09 02:40:11,046 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-09 02:40:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2025-03-09 02:40:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2025-03-09 02:40:11,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:11,049 INFO L218 NwaCegarLoop]: trace histogram [63, 59, 51, 32, 32, 32, 32, 30, 30, 30, 30, 30, 29, 29, 29, 28, 19, 12, 1, 1, 1, 1, 1] [2025-03-09 02:40:11,055 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-09 02:40:11,253 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,SelfDestructingSolverStorable14 [2025-03-09 02:40:11,253 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:11,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:11,254 INFO L85 PathProgramCache]: Analyzing trace with hash -634311118, now seen corresponding path program 9 times [2025-03-09 02:40:11,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:11,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572886097] [2025-03-09 02:40:11,254 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:40:11,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:11,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 602 statements into 47 equivalence classes. [2025-03-09 02:40:11,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) and asserted 334 of 602 statements. [2025-03-09 02:40:11,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2025-03-09 02:40:11,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 13049 backedges. 3785 proven. 1063 refuted. 0 times theorem prover too weak. 8201 trivial. 0 not checked. [2025-03-09 02:40:12,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:12,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572886097] [2025-03-09 02:40:12,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572886097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:12,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035010051] [2025-03-09 02:40:12,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:40:12,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:12,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:12,753 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-09 02:40:12,760 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-09 02:40:12,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 602 statements into 47 equivalence classes. [2025-03-09 02:40:12,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) and asserted 334 of 602 statements. [2025-03-09 02:40:12,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2025-03-09 02:40:12,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:12,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-09 02:40:12,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 13049 backedges. 3785 proven. 797 refuted. 0 times theorem prover too weak. 8467 trivial. 0 not checked. [2025-03-09 02:40:13,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:17,515 INFO L134 CoverageAnalysis]: Checked inductivity of 13049 backedges. 4033 proven. 736 refuted. 0 times theorem prover too weak. 8280 trivial. 0 not checked. [2025-03-09 02:40:17,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035010051] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:17,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:17,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 26] total 45 [2025-03-09 02:40:17,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380799372] [2025-03-09 02:40:17,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:17,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-09 02:40:17,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:17,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-09 02:40:17,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1607, Unknown=0, NotChecked=0, Total=2070 [2025-03-09 02:40:17,517 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 46 states, 45 states have (on average 2.8444444444444446) internal successors, (128), 46 states have internal predecessors, (128), 12 states have call successors, (14), 1 states have call predecessors, (14), 14 states have return successors, (33), 32 states have call predecessors, (33), 12 states have call successors, (33) [2025-03-09 02:40:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:17,748 INFO L93 Difference]: Finished difference Result 171 states and 244 transitions. [2025-03-09 02:40:17,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-09 02:40:17,749 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.8444444444444446) internal successors, (128), 46 states have internal predecessors, (128), 12 states have call successors, (14), 1 states have call predecessors, (14), 14 states have return successors, (33), 32 states have call predecessors, (33), 12 states have call successors, (33) Word has length 602 [2025-03-09 02:40:17,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:17,751 INFO L225 Difference]: With dead ends: 171 [2025-03-09 02:40:17,751 INFO L226 Difference]: Without dead ends: 170 [2025-03-09 02:40:17,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1280 GetRequests, 1186 SyntacticMatches, 41 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2326 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=654, Invalid=2316, Unknown=0, NotChecked=0, Total=2970 [2025-03-09 02:40:17,752 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:17,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 230 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:40:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-09 02:40:17,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 143. [2025-03-09 02:40:17,763 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-09 02:40:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 204 transitions. [2025-03-09 02:40:17,764 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 204 transitions. Word has length 602 [2025-03-09 02:40:17,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:17,764 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 204 transitions. [2025-03-09 02:40:17,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.8444444444444446) internal successors, (128), 46 states have internal predecessors, (128), 12 states have call successors, (14), 1 states have call predecessors, (14), 14 states have return successors, (33), 32 states have call predecessors, (33), 12 states have call successors, (33) [2025-03-09 02:40:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2025-03-09 02:40:17,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1172 [2025-03-09 02:40:17,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:17,771 INFO L218 NwaCegarLoop]: trace histogram [121, 117, 98, 61, 61, 61, 61, 59, 59, 59, 59, 59, 58, 58, 58, 57, 37, 23, 1, 1, 1, 1, 1] [2025-03-09 02:40:17,777 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-09 02:40:17,975 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,SelfDestructingSolverStorable15 [2025-03-09 02:40:17,975 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:17,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:17,975 INFO L85 PathProgramCache]: Analyzing trace with hash 53326905, now seen corresponding path program 10 times [2025-03-09 02:40:17,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:17,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644988198] [2025-03-09 02:40:17,976 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:40:17,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:17,995 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1171 statements into 2 equivalence classes. [2025-03-09 02:40:18,055 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 695 of 1171 statements. [2025-03-09 02:40:18,056 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 02:40:18,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 50138 backedges. 1242 proven. 7557 refuted. 0 times theorem prover too weak. 41339 trivial. 0 not checked. [2025-03-09 02:40:18,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:18,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644988198] [2025-03-09 02:40:18,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644988198] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:18,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430391919] [2025-03-09 02:40:18,728 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:40:18,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:18,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:18,730 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-09 02:40:18,732 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-09 02:40:18,882 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1171 statements into 2 equivalence classes. [2025-03-09 02:40:18,989 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 695 of 1171 statements. [2025-03-09 02:40:18,990 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 02:40:18,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:18,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 1455 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 02:40:19,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:19,169 INFO L134 CoverageAnalysis]: Checked inductivity of 50138 backedges. 26148 proven. 2740 refuted. 0 times theorem prover too weak. 21250 trivial. 0 not checked. [2025-03-09 02:40:19,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 50138 backedges. 1487 proven. 9176 refuted. 0 times theorem prover too weak. 39475 trivial. 0 not checked. [2025-03-09 02:40:21,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430391919] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:21,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:21,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 25] total 30 [2025-03-09 02:40:21,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218547155] [2025-03-09 02:40:21,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:21,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-09 02:40:21,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:21,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-09 02:40:21,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2025-03-09 02:40:21,240 INFO L87 Difference]: Start difference. First operand 143 states and 204 transitions. Second operand has 30 states, 30 states have (on average 6.0) internal successors, (180), 30 states have internal predecessors, (180), 25 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (37), 14 states have call predecessors, (37), 23 states have call successors, (37) [2025-03-09 02:40:21,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:21,693 INFO L93 Difference]: Finished difference Result 353 states and 578 transitions. [2025-03-09 02:40:21,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-09 02:40:21,694 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.0) internal successors, (180), 30 states have internal predecessors, (180), 25 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (37), 14 states have call predecessors, (37), 23 states have call successors, (37) Word has length 1171 [2025-03-09 02:40:21,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:21,696 INFO L225 Difference]: With dead ends: 353 [2025-03-09 02:40:21,696 INFO L226 Difference]: Without dead ends: 216 [2025-03-09 02:40:21,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2394 GetRequests, 2325 SyntacticMatches, 15 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=796, Invalid=2284, Unknown=0, NotChecked=0, Total=3080 [2025-03-09 02:40:21,698 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 183 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:21,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 177 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:40:21,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-09 02:40:21,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 194. [2025-03-09 02:40:21,710 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-09 02:40:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 274 transitions. [2025-03-09 02:40:21,711 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 274 transitions. Word has length 1171 [2025-03-09 02:40:21,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:21,713 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 274 transitions. [2025-03-09 02:40:21,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.0) internal successors, (180), 30 states have internal predecessors, (180), 25 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (37), 14 states have call predecessors, (37), 23 states have call successors, (37) [2025-03-09 02:40:21,713 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 274 transitions. [2025-03-09 02:40:21,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1068 [2025-03-09 02:40:21,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:21,719 INFO L218 NwaCegarLoop]: trace histogram [110, 107, 89, 55, 55, 55, 55, 54, 54, 54, 54, 54, 53, 53, 53, 52, 34, 21, 1, 1, 1, 1, 1] [2025-03-09 02:40:21,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-09 02:40:21,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:21,920 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:21,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:21,921 INFO L85 PathProgramCache]: Analyzing trace with hash -776443936, now seen corresponding path program 11 times [2025-03-09 02:40:21,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:21,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286414619] [2025-03-09 02:40:21,921 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:40:21,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:21,938 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1067 statements into 77 equivalence classes. [2025-03-09 02:40:22,025 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) and asserted 709 of 1067 statements. [2025-03-09 02:40:22,025 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2025-03-09 02:40:22,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 41561 backedges. 4652 proven. 3292 refuted. 0 times theorem prover too weak. 33617 trivial. 0 not checked. [2025-03-09 02:40:22,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:22,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286414619] [2025-03-09 02:40:22,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286414619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:22,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927508534] [2025-03-09 02:40:22,744 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:40:22,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:22,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:22,746 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-09 02:40:22,747 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-09 02:40:22,891 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1067 statements into 77 equivalence classes. [2025-03-09 02:40:23,055 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) and asserted 709 of 1067 statements. [2025-03-09 02:40:23,055 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2025-03-09 02:40:23,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:23,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 1314 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 02:40:23,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 41561 backedges. 20911 proven. 1171 refuted. 0 times theorem prover too weak. 19479 trivial. 0 not checked. [2025-03-09 02:40:23,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 41561 backedges. 4810 proven. 3534 refuted. 0 times theorem prover too weak. 33217 trivial. 0 not checked. [2025-03-09 02:40:25,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927508534] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:25,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:25,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 21] total 28 [2025-03-09 02:40:25,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057064524] [2025-03-09 02:40:25,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:25,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 02:40:25,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:25,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 02:40:25,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2025-03-09 02:40:25,333 INFO L87 Difference]: Start difference. First operand 194 states and 274 transitions. Second operand has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 20 states have call successors, (27), 2 states have call predecessors, (27), 12 states have return successors, (33), 14 states have call predecessors, (33), 20 states have call successors, (33) [2025-03-09 02:40:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:25,656 INFO L93 Difference]: Finished difference Result 358 states and 541 transitions. [2025-03-09 02:40:25,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-09 02:40:25,657 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 20 states have call successors, (27), 2 states have call predecessors, (27), 12 states have return successors, (33), 14 states have call predecessors, (33), 20 states have call successors, (33) Word has length 1067 [2025-03-09 02:40:25,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:25,659 INFO L225 Difference]: With dead ends: 358 [2025-03-09 02:40:25,659 INFO L226 Difference]: Without dead ends: 170 [2025-03-09 02:40:25,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2174 GetRequests, 2119 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=539, Invalid=1531, Unknown=0, NotChecked=0, Total=2070 [2025-03-09 02:40:25,661 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 124 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:25,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 194 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:40:25,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-09 02:40:25,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2025-03-09 02:40:25,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 110 states have (on average 1.0272727272727273) internal successors, (113), 108 states have internal predecessors, (113), 17 states have call successors, (17), 12 states have call predecessors, (17), 9 states have return successors, (44), 16 states have call predecessors, (44), 16 states have call successors, (44) [2025-03-09 02:40:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 174 transitions. [2025-03-09 02:40:25,671 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 174 transitions. Word has length 1067 [2025-03-09 02:40:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:25,672 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 174 transitions. [2025-03-09 02:40:25,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 20 states have call successors, (27), 2 states have call predecessors, (27), 12 states have return successors, (33), 14 states have call predecessors, (33), 20 states have call successors, (33) [2025-03-09 02:40:25,672 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 174 transitions. [2025-03-09 02:40:25,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1237 [2025-03-09 02:40:25,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:25,679 INFO L218 NwaCegarLoop]: trace histogram [128, 123, 104, 65, 65, 65, 65, 62, 62, 62, 62, 62, 61, 61, 61, 60, 39, 24, 1, 1, 1, 1, 1] [2025-03-09 02:40:25,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-09 02:40:25,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 02:40:25,884 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:25,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:25,885 INFO L85 PathProgramCache]: Analyzing trace with hash 201180579, now seen corresponding path program 12 times [2025-03-09 02:40:25,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:25,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759025272] [2025-03-09 02:40:25,885 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 02:40:25,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:25,902 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1236 statements into 91 equivalence classes. [2025-03-09 02:40:25,984 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 62 check-sat command(s) and asserted 827 of 1236 statements. [2025-03-09 02:40:25,984 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 62 check-sat command(s) [2025-03-09 02:40:25,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:27,232 INFO L134 CoverageAnalysis]: Checked inductivity of 55912 backedges. 4137 proven. 8877 refuted. 0 times theorem prover too weak. 42898 trivial. 0 not checked. [2025-03-09 02:40:27,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:27,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759025272] [2025-03-09 02:40:27,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759025272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:27,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101115398] [2025-03-09 02:40:27,233 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 02:40:27,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:27,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:27,235 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-09 02:40:27,236 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-09 02:40:27,395 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1236 statements into 91 equivalence classes. [2025-03-09 02:40:27,564 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 62 check-sat command(s) and asserted 827 of 1236 statements. [2025-03-09 02:40:27,564 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 62 check-sat command(s) [2025-03-09 02:40:27,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:27,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 1542 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 02:40:27,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:27,730 INFO L134 CoverageAnalysis]: Checked inductivity of 55912 backedges. 28204 proven. 3991 refuted. 0 times theorem prover too weak. 23717 trivial. 0 not checked. [2025-03-09 02:40:27,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 55912 backedges. 3699 proven. 8098 refuted. 0 times theorem prover too weak. 44115 trivial. 0 not checked. [2025-03-09 02:40:29,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101115398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:29,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:29,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19, 27] total 36 [2025-03-09 02:40:29,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650668822] [2025-03-09 02:40:29,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:29,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-09 02:40:29,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:29,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-09 02:40:29,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 02:40:29,810 INFO L87 Difference]: Start difference. First operand 137 states and 174 transitions. Second operand has 36 states, 36 states have (on average 5.777777777777778) internal successors, (208), 35 states have internal predecessors, (208), 30 states have call successors, (37), 5 states have call predecessors, (37), 14 states have return successors, (43), 17 states have call predecessors, (43), 27 states have call successors, (43) [2025-03-09 02:40:30,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:30,288 INFO L93 Difference]: Finished difference Result 335 states and 463 transitions. [2025-03-09 02:40:30,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-09 02:40:30,289 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.777777777777778) internal successors, (208), 35 states have internal predecessors, (208), 30 states have call successors, (37), 5 states have call predecessors, (37), 14 states have return successors, (43), 17 states have call predecessors, (43), 27 states have call successors, (43) Word has length 1236 [2025-03-09 02:40:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:30,291 INFO L225 Difference]: With dead ends: 335 [2025-03-09 02:40:30,291 INFO L226 Difference]: Without dead ends: 204 [2025-03-09 02:40:30,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2543 GetRequests, 2458 SyntacticMatches, 17 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1140, Invalid=3690, Unknown=0, NotChecked=0, Total=4830 [2025-03-09 02:40:30,293 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 518 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:30,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 214 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:40:30,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-09 02:40:30,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 176. [2025-03-09 02:40:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 143 states have (on average 1.034965034965035) internal successors, (148), 139 states have internal predecessors, (148), 22 states have call successors, (22), 17 states have call predecessors, (22), 10 states have return successors, (57), 19 states have call predecessors, (57), 21 states have call successors, (57) [2025-03-09 02:40:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 227 transitions. [2025-03-09 02:40:30,303 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 227 transitions. Word has length 1236 [2025-03-09 02:40:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:30,303 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 227 transitions. [2025-03-09 02:40:30,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.777777777777778) internal successors, (208), 35 states have internal predecessors, (208), 30 states have call successors, (37), 5 states have call predecessors, (37), 14 states have return successors, (43), 17 states have call predecessors, (43), 27 states have call successors, (43) [2025-03-09 02:40:30,304 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 227 transitions. [2025-03-09 02:40:30,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2025-03-09 02:40:30,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:30,307 INFO L218 NwaCegarLoop]: trace histogram [84, 82, 68, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 41, 40, 26, 16, 1, 1, 1, 1, 1] [2025-03-09 02:40:30,315 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-09 02:40:30,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:30,508 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:30,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:30,508 INFO L85 PathProgramCache]: Analyzing trace with hash 840937960, now seen corresponding path program 13 times [2025-03-09 02:40:30,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:30,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792574032] [2025-03-09 02:40:30,508 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 02:40:30,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:30,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 817 statements into 1 equivalence classes. [2025-03-09 02:40:30,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 817 of 817 statements. [2025-03-09 02:40:30,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:30,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 24215 backedges. 2309 proven. 4945 refuted. 0 times theorem prover too weak. 16961 trivial. 0 not checked. [2025-03-09 02:40:31,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:31,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792574032] [2025-03-09 02:40:31,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792574032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:31,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159702484] [2025-03-09 02:40:31,371 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 02:40:31,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:31,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:31,374 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-09 02:40:31,375 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-09 02:40:31,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 817 statements into 1 equivalence classes. [2025-03-09 02:40:31,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 817 of 817 statements. [2025-03-09 02:40:31,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:31,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:31,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 1528 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 02:40:31,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:31,782 INFO L134 CoverageAnalysis]: Checked inductivity of 24215 backedges. 12370 proven. 2667 refuted. 0 times theorem prover too weak. 9178 trivial. 0 not checked. [2025-03-09 02:40:31,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 24215 backedges. 2300 proven. 5308 refuted. 0 times theorem prover too weak. 16607 trivial. 0 not checked. [2025-03-09 02:40:34,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159702484] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:34,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:34,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 27] total 32 [2025-03-09 02:40:34,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795299480] [2025-03-09 02:40:34,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:34,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-09 02:40:34,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:34,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-09 02:40:34,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2025-03-09 02:40:34,257 INFO L87 Difference]: Start difference. First operand 176 states and 227 transitions. Second operand has 32 states, 32 states have (on average 5.71875) internal successors, (183), 32 states have internal predecessors, (183), 26 states have call successors, (31), 2 states have call predecessors, (31), 14 states have return successors, (40), 14 states have call predecessors, (40), 26 states have call successors, (40) [2025-03-09 02:40:34,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:34,622 INFO L93 Difference]: Finished difference Result 355 states and 472 transitions. [2025-03-09 02:40:34,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-09 02:40:34,622 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.71875) internal successors, (183), 32 states have internal predecessors, (183), 26 states have call successors, (31), 2 states have call predecessors, (31), 14 states have return successors, (40), 14 states have call predecessors, (40), 26 states have call successors, (40) Word has length 817 [2025-03-09 02:40:34,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:34,624 INFO L225 Difference]: With dead ends: 355 [2025-03-09 02:40:34,624 INFO L226 Difference]: Without dead ends: 185 [2025-03-09 02:40:34,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1678 GetRequests, 1617 SyntacticMatches, 13 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=632, Invalid=1818, Unknown=0, NotChecked=0, Total=2450 [2025-03-09 02:40:34,626 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 173 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:34,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 264 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:40:34,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-09 02:40:34,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 149. [2025-03-09 02:40:34,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 120 states have (on average 1.025) internal successors, (123), 118 states have internal predecessors, (123), 19 states have call successors, (19), 14 states have call predecessors, (19), 9 states have return successors, (45), 16 states have call predecessors, (45), 18 states have call successors, (45) [2025-03-09 02:40:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 187 transitions. [2025-03-09 02:40:34,634 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 187 transitions. Word has length 817 [2025-03-09 02:40:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:34,635 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 187 transitions. [2025-03-09 02:40:34,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.71875) internal successors, (183), 32 states have internal predecessors, (183), 26 states have call successors, (31), 2 states have call predecessors, (31), 14 states have return successors, (40), 14 states have call predecessors, (40), 26 states have call successors, (40) [2025-03-09 02:40:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 187 transitions. [2025-03-09 02:40:34,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2025-03-09 02:40:34,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:34,640 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-09 02:40:34,648 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-09 02:40:34,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:34,841 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:34,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:34,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1653235746, now seen corresponding path program 14 times [2025-03-09 02:40:34,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:34,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230503843] [2025-03-09 02:40:34,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:34,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:34,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1066 statements into 2 equivalence classes. [2025-03-09 02:40:34,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1066 of 1066 statements. [2025-03-09 02:40:34,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:34,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 6794 proven. 10267 refuted. 0 times theorem prover too weak. 24405 trivial. 0 not checked. [2025-03-09 02:40:49,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:49,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230503843] [2025-03-09 02:40:49,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230503843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:49,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644415928] [2025-03-09 02:40:49,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:49,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:49,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:49,701 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-09 02:40:49,702 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-09 02:40:49,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1066 statements into 2 equivalence classes. [2025-03-09 02:40:50,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1066 of 1066 statements. [2025-03-09 02:40:50,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:50,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:50,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 1989 conjuncts, 217 conjuncts are in the unsatisfiable core [2025-03-09 02:40:50,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 6686 proven. 7855 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2025-03-09 02:40:50,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 7863 proven. 7392 refuted. 0 times theorem prover too weak. 26211 trivial. 0 not checked. [2025-03-09 02:41:23,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644415928] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:23,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:23,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 41] total 59 [2025-03-09 02:41:23,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113007279] [2025-03-09 02:41:23,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:23,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-03-09 02:41:23,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:23,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-03-09 02:41:23,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=770, Invalid=2770, Unknown=0, NotChecked=0, Total=3540 [2025-03-09 02:41:23,638 INFO L87 Difference]: Start difference. First operand 149 states and 187 transitions. Second operand has 60 states, 59 states have (on average 2.593220338983051) internal successors, (153), 60 states have internal predecessors, (153), 16 states have call successors, (17), 1 states have call predecessors, (17), 17 states have return successors, (41), 41 states have call predecessors, (41), 16 states have call successors, (41) [2025-03-09 02:41:23,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:23,925 INFO L93 Difference]: Finished difference Result 213 states and 311 transitions. [2025-03-09 02:41:23,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-09 02:41:23,925 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 2.593220338983051) internal successors, (153), 60 states have internal predecessors, (153), 16 states have call successors, (17), 1 states have call predecessors, (17), 17 states have return successors, (41), 41 states have call predecessors, (41), 16 states have call successors, (41) Word has length 1066 [2025-03-09 02:41:23,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:23,927 INFO L225 Difference]: With dead ends: 213 [2025-03-09 02:41:23,927 INFO L226 Difference]: Without dead ends: 212 [2025-03-09 02:41:23,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2356 GetRequests, 2129 SyntacticMatches, 160 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7771 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=999, Invalid=3693, Unknown=0, NotChecked=0, Total=4692 [2025-03-09 02:41:23,929 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:23,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 228 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:23,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-09 02:41:23,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 185. [2025-03-09 02:41:23,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 148 states have (on average 1.0202702702702702) internal successors, (151), 146 states have internal predecessors, (151), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (97), 24 states have call predecessors, (97), 22 states have call successors, (97) [2025-03-09 02:41:23,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 271 transitions. [2025-03-09 02:41:23,943 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 271 transitions. Word has length 1066 [2025-03-09 02:41:23,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:23,944 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 271 transitions. [2025-03-09 02:41:23,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 2.593220338983051) internal successors, (153), 60 states have internal predecessors, (153), 16 states have call successors, (17), 1 states have call predecessors, (17), 17 states have return successors, (41), 41 states have call predecessors, (41), 16 states have call successors, (41) [2025-03-09 02:41:23,945 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 271 transitions. [2025-03-09 02:41:23,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3342 [2025-03-09 02:41:23,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:23,984 INFO L218 NwaCegarLoop]: trace histogram [343, 337, 278, 173, 173, 173, 173, 169, 169, 169, 169, 169, 168, 168, 168, 167, 105, 65, 1, 1, 1, 1, 1] [2025-03-09 02:41:23,993 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-09 02:41:24,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:24,185 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:24,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:24,186 INFO L85 PathProgramCache]: Analyzing trace with hash -757272163, now seen corresponding path program 15 times [2025-03-09 02:41:24,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:24,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404757661] [2025-03-09 02:41:24,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:41:24,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:24,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3341 statements into 251 equivalence classes. [2025-03-09 02:41:24,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 117 check-sat command(s) and asserted 1507 of 3341 statements. [2025-03-09 02:41:24,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 117 check-sat command(s) [2025-03-09 02:41:24,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat