./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7261cadd839cd02322bb28945f92ad1bd2170c0a65dd385996b5ff81cbb1de7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 21:09:35,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 21:09:35,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 21:09:35,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 21:09:35,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 21:09:35,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 21:09:35,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 21:09:35,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 21:09:35,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 21:09:35,108 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 21:09:35,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 21:09:35,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 21:09:35,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 21:09:35,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 21:09:35,110 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 21:09:35,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 21:09:35,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 21:09:35,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 21:09:35,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 21:09:35,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 21:09:35,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 21:09:35,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 21:09:35,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 21:09:35,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 21:09:35,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 21:09:35,113 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 21:09:35,113 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 21:09:35,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 21:09:35,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 21:09:35,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 21:09:35,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 21:09:35,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 21:09:35,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 21:09:35,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 21:09:35,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:09:35,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 21:09:35,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 21:09:35,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 21:09:35,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 21:09:35,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 21:09:35,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 21:09:35,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 21:09:35,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 21:09:35,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 21:09:35,117 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7261cadd839cd02322bb28945f92ad1bd2170c0a65dd385996b5ff81cbb1de7 [2024-10-14 21:09:35,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 21:09:35,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 21:09:35,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 21:09:35,338 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 21:09:35,340 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 21:09:35,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c [2024-10-14 21:09:36,510 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 21:09:36,642 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 21:09:36,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c [2024-10-14 21:09:36,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e257ebc89/2019eadb2b8043de9a234eb4279c4a86/FLAGda267f26a [2024-10-14 21:09:36,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e257ebc89/2019eadb2b8043de9a234eb4279c4a86 [2024-10-14 21:09:36,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 21:09:36,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 21:09:36,664 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 21:09:36,664 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 21:09:36,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 21:09:36,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:09:36" (1/1) ... [2024-10-14 21:09:36,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56510c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:36, skipping insertion in model container [2024-10-14 21:09:36,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:09:36" (1/1) ... [2024-10-14 21:09:36,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 21:09:36,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:09:36,834 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 21:09:36,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:09:36,860 INFO L204 MainTranslator]: Completed translation [2024-10-14 21:09:36,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:36 WrapperNode [2024-10-14 21:09:36,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 21:09:36,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 21:09:36,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 21:09:36,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 21:09:36,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:36" (1/1) ... [2024-10-14 21:09:36,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:36" (1/1) ... [2024-10-14 21:09:36,888 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2024-10-14 21:09:36,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 21:09:36,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 21:09:36,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 21:09:36,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 21:09:36,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:36" (1/1) ... [2024-10-14 21:09:36,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:36" (1/1) ... [2024-10-14 21:09:36,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:36" (1/1) ... [2024-10-14 21:09:36,915 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]. [2024-10-14 21:09:36,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:36" (1/1) ... [2024-10-14 21:09:36,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:36" (1/1) ... [2024-10-14 21:09:36,917 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:36" (1/1) ... [2024-10-14 21:09:36,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:36" (1/1) ... [2024-10-14 21:09:36,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:36" (1/1) ... [2024-10-14 21:09:36,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:36" (1/1) ... [2024-10-14 21:09:36,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 21:09:36,923 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 21:09:36,923 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 21:09:36,923 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 21:09:36,924 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:36" (1/1) ... [2024-10-14 21:09:36,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:09:36,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:36,948 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) [2024-10-14 21:09:36,950 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 [2024-10-14 21:09:36,984 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2024-10-14 21:09:36,984 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2024-10-14 21:09:36,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 21:09:36,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 21:09:36,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 21:09:36,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 21:09:37,031 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 21:09:37,032 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 21:09:37,123 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 21:09:37,123 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 21:09:37,140 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 21:09:37,140 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 21:09:37,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:09:37 BoogieIcfgContainer [2024-10-14 21:09:37,140 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 21:09:37,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 21:09:37,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 21:09:37,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 21:09:37,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:09:36" (1/3) ... [2024-10-14 21:09:37,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe16deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:09:37, skipping insertion in model container [2024-10-14 21:09:37,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:36" (2/3) ... [2024-10-14 21:09:37,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe16deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:09:37, skipping insertion in model container [2024-10-14 21:09:37,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:09:37" (3/3) ... [2024-10-14 21:09:37,147 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2024-10-14 21:09:37,162 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 21:09:37,162 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-14 21:09:37,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 21:09:37,209 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;@569b6a33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 21:09:37,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-14 21:09:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 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) [2024-10-14 21:09:37,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 21:09:37,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:37,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 21:09:37,218 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:09:37,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1932596477, now seen corresponding path program 1 times [2024-10-14 21:09:37,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:37,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748994384] [2024-10-14 21:09:37,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:37,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:37,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:09:37,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:37,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748994384] [2024-10-14 21:09:37,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748994384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:09:37,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:09:37,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:09:37,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121429075] [2024-10-14 21:09:37,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:09:37,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 21:09:37,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:37,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 21:09:37,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:09:37,383 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 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 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-10-14 21:09:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:37,422 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-10-14 21:09:37,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 21:09:37,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-10-14 21:09:37,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:37,432 INFO L225 Difference]: With dead ends: 31 [2024-10-14 21:09:37,432 INFO L226 Difference]: Without dead ends: 23 [2024-10-14 21:09:37,434 INFO L431 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 [2024-10-14 21:09:37,437 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:37,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 30 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:09:37,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-14 21:09:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-10-14 21:09:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.4615384615384615) 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) [2024-10-14 21:09:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-10-14 21:09:37,463 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 6 [2024-10-14 21:09:37,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:37,463 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-10-14 21:09:37,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-10-14 21:09:37,463 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-10-14 21:09:37,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 21:09:37,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:37,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:09:37,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 21:09:37,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:09:37,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:37,465 INFO L85 PathProgramCache]: Analyzing trace with hash 219051399, now seen corresponding path program 1 times [2024-10-14 21:09:37,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:37,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109508912] [2024-10-14 21:09:37,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:37,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:37,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:09:37,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:37,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109508912] [2024-10-14 21:09:37,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109508912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:09:37,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:09:37,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:09:37,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752256023] [2024-10-14 21:09:37,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:09:37,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:09:37,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:37,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:09:37,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:09:37,551 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:09:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:37,617 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-10-14 21:09:37,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:09:37,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 21:09:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:37,618 INFO L225 Difference]: With dead ends: 23 [2024-10-14 21:09:37,618 INFO L226 Difference]: Without dead ends: 21 [2024-10-14 21:09:37,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:09:37,620 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:37,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 22 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:09:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-14 21:09:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-10-14 21:09:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 15 states have internal predecessors, (17), 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) [2024-10-14 21:09:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-10-14 21:09:37,625 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 7 [2024-10-14 21:09:37,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:37,625 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-14 21:09:37,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:09:37,625 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-10-14 21:09:37,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 21:09:37,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:37,626 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:09:37,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 21:09:37,627 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:09:37,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:37,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1794218543, now seen corresponding path program 1 times [2024-10-14 21:09:37,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:37,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416503800] [2024-10-14 21:09:37,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:37,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:37,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:09:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:37,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 21:09:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:37,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 21:09:37,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:37,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416503800] [2024-10-14 21:09:37,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416503800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:09:37,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:09:37,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 21:09:37,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775200850] [2024-10-14 21:09:37,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:09:37,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:09:37,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:37,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:09:37,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:09:37,826 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-10-14 21:09:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:37,860 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-10-14 21:09:37,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:09:37,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 22 [2024-10-14 21:09:37,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:37,862 INFO L225 Difference]: With dead ends: 33 [2024-10-14 21:09:37,862 INFO L226 Difference]: Without dead ends: 31 [2024-10-14 21:09:37,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:09:37,863 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:37,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 46 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:09:37,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-14 21:09:37,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-10-14 21:09:37,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 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) [2024-10-14 21:09:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-10-14 21:09:37,870 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 22 [2024-10-14 21:09:37,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:37,870 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-10-14 21:09:37,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-10-14 21:09:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-10-14 21:09:37,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 21:09:37,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:37,872 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:09:37,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 21:09:37,872 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:09:37,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:37,873 INFO L85 PathProgramCache]: Analyzing trace with hash 605645438, now seen corresponding path program 1 times [2024-10-14 21:09:37,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:37,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443522623] [2024-10-14 21:09:37,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:37,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:37,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 21:09:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:37,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 21:09:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 21:09:37,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:37,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443522623] [2024-10-14 21:09:37,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443522623] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:09:37,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796585535] [2024-10-14 21:09:37,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:37,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:37,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:37,991 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) [2024-10-14 21:09:37,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 21:09:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:38,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 21:09:38,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:38,147 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:09:38,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:09:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 21:09:38,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796585535] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:09:38,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:09:38,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2024-10-14 21:09:38,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700090313] [2024-10-14 21:09:38,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:09:38,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 21:09:38,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:38,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 21:09:38,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-10-14 21:09:38,292 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 21:09:38,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:38,726 INFO L93 Difference]: Finished difference Result 177 states and 257 transitions. [2024-10-14 21:09:38,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 21:09:38,727 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2024-10-14 21:09:38,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:38,729 INFO L225 Difference]: With dead ends: 177 [2024-10-14 21:09:38,731 INFO L226 Difference]: Without dead ends: 144 [2024-10-14 21:09:38,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2024-10-14 21:09:38,734 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 154 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:38,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 301 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:09:38,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-14 21:09:38,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 128. [2024-10-14 21:09:38,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 99 states have (on average 1.1111111111111112) internal successors, (110), 101 states have internal predecessors, (110), 17 states have call successors, (17), 5 states have call predecessors, (17), 10 states have return successors, (46), 21 states have call predecessors, (46), 16 states have call successors, (46) [2024-10-14 21:09:38,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 173 transitions. [2024-10-14 21:09:38,759 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 173 transitions. Word has length 29 [2024-10-14 21:09:38,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:38,760 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 173 transitions. [2024-10-14 21:09:38,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 21:09:38,761 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 173 transitions. [2024-10-14 21:09:38,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 21:09:38,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:38,762 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:09:38,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 21:09:38,962 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 [2024-10-14 21:09:38,963 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:09:38,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:38,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1969889286, now seen corresponding path program 2 times [2024-10-14 21:09:38,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:38,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388370111] [2024-10-14 21:09:38,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:38,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:39,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:09:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:39,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:09:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-14 21:09:39,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:39,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388370111] [2024-10-14 21:09:39,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388370111] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:09:39,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866796752] [2024-10-14 21:09:39,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:09:39,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:39,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:39,087 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) [2024-10-14 21:09:39,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 21:09:39,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:09:39,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:09:39,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 21:09:39,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-14 21:09:39,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:09:39,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866796752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:09:39,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:09:39,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-14 21:09:39,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809378124] [2024-10-14 21:09:39,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:09:39,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:09:39,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:39,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:09:39,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:09:39,174 INFO L87 Difference]: Start difference. First operand 128 states and 173 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:09:39,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:39,206 INFO L93 Difference]: Finished difference Result 151 states and 209 transitions. [2024-10-14 21:09:39,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:09:39,206 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2024-10-14 21:09:39,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:39,211 INFO L225 Difference]: With dead ends: 151 [2024-10-14 21:09:39,212 INFO L226 Difference]: Without dead ends: 150 [2024-10-14 21:09:39,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:09:39,215 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:39,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:09:39,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-14 21:09:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2024-10-14 21:09:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.1037735849056605) internal successors, (117), 106 states have internal predecessors, (117), 17 states have call successors, (17), 5 states have call predecessors, (17), 11 states have return successors, (55), 24 states have call predecessors, (55), 16 states have call successors, (55) [2024-10-14 21:09:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2024-10-14 21:09:39,245 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 41 [2024-10-14 21:09:39,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:39,246 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2024-10-14 21:09:39,246 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:09:39,246 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2024-10-14 21:09:39,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 21:09:39,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:39,247 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:09:39,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 21:09:39,447 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 [2024-10-14 21:09:39,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:09:39,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:39,448 INFO L85 PathProgramCache]: Analyzing trace with hash -937025668, now seen corresponding path program 1 times [2024-10-14 21:09:39,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:39,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681623878] [2024-10-14 21:09:39,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:39,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:39,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:09:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:39,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:09:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:39,527 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-14 21:09:39,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:39,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681623878] [2024-10-14 21:09:39,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681623878] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:09:39,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294777306] [2024-10-14 21:09:39,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:39,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:39,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:39,530 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) [2024-10-14 21:09:39,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 21:09:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:39,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 21:09:39,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:39,701 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:09:39,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:09:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 21:09:39,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294777306] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:09:39,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:09:39,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 13] total 25 [2024-10-14 21:09:39,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314647504] [2024-10-14 21:09:39,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:09:39,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 21:09:39,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:39,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 21:09:39,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2024-10-14 21:09:39,893 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 25 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 18 states have internal predecessors, (71), 12 states have call successors, (15), 9 states have call predecessors, (15), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 21:09:40,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:40,634 INFO L93 Difference]: Finished difference Result 425 states and 669 transitions. [2024-10-14 21:09:40,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-14 21:09:40,634 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 18 states have internal predecessors, (71), 12 states have call successors, (15), 9 states have call predecessors, (15), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2024-10-14 21:09:40,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:40,637 INFO L225 Difference]: With dead ends: 425 [2024-10-14 21:09:40,637 INFO L226 Difference]: Without dead ends: 303 [2024-10-14 21:09:40,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=1365, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 21:09:40,640 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 224 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:40,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 517 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 21:09:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-14 21:09:40,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 270. [2024-10-14 21:09:40,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 212 states have (on average 1.099056603773585) internal successors, (233), 212 states have internal predecessors, (233), 34 states have call successors, (34), 10 states have call predecessors, (34), 22 states have return successors, (103), 47 states have call predecessors, (103), 33 states have call successors, (103) [2024-10-14 21:09:40,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 370 transitions. [2024-10-14 21:09:40,663 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 370 transitions. Word has length 42 [2024-10-14 21:09:40,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:40,663 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 370 transitions. [2024-10-14 21:09:40,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 18 states have internal predecessors, (71), 12 states have call successors, (15), 9 states have call predecessors, (15), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 21:09:40,664 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 370 transitions. [2024-10-14 21:09:40,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 21:09:40,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:40,665 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:09:40,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 21:09:40,869 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 [2024-10-14 21:09:40,870 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:09:40,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:40,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1677645046, now seen corresponding path program 1 times [2024-10-14 21:09:40,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:40,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956911584] [2024-10-14 21:09:40,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:40,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:40,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 21:09:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:40,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 21:09:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-10-14 21:09:40,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:40,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956911584] [2024-10-14 21:09:40,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956911584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:09:40,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:09:40,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 21:09:40,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997278349] [2024-10-14 21:09:40,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:09:40,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:09:40,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:40,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:09:40,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:09:40,965 INFO L87 Difference]: Start difference. First operand 270 states and 370 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:09:41,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:41,011 INFO L93 Difference]: Finished difference Result 284 states and 392 transitions. [2024-10-14 21:09:41,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:09:41,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2024-10-14 21:09:41,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:41,014 INFO L225 Difference]: With dead ends: 284 [2024-10-14 21:09:41,014 INFO L226 Difference]: Without dead ends: 283 [2024-10-14 21:09:41,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:09:41,015 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:41,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 77 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:09:41,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-14 21:09:41,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 277. [2024-10-14 21:09:41,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 218 states have (on average 1.0963302752293578) internal successors, (239), 217 states have internal predecessors, (239), 35 states have call successors, (35), 10 states have call predecessors, (35), 22 states have return successors, (109), 49 states have call predecessors, (109), 34 states have call successors, (109) [2024-10-14 21:09:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 383 transitions. [2024-10-14 21:09:41,035 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 383 transitions. Word has length 67 [2024-10-14 21:09:41,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:41,035 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 383 transitions. [2024-10-14 21:09:41,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:09:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 383 transitions. [2024-10-14 21:09:41,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 21:09:41,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:41,037 INFO L215 NwaCegarLoop]: trace histogram [12, 10, 9, 9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 21:09:41,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 21:09:41,038 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:09:41,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:41,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1796921857, now seen corresponding path program 1 times [2024-10-14 21:09:41,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:41,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489346958] [2024-10-14 21:09:41,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:41,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:41,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 21:09:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:41,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 21:09:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:41,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:41,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:09:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-10-14 21:09:41,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:41,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489346958] [2024-10-14 21:09:41,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489346958] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:09:41,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863159508] [2024-10-14 21:09:41,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:41,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:41,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:41,110 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) [2024-10-14 21:09:41,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 21:09:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:41,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 21:09:41,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:41,382 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 100 proven. 184 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-14 21:09:41,382 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:09:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 2 proven. 285 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 21:09:41,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863159508] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:09:41,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:09:41,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 21, 21] total 25 [2024-10-14 21:09:41,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986120444] [2024-10-14 21:09:41,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:09:41,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 21:09:41,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:41,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 21:09:41,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2024-10-14 21:09:41,625 INFO L87 Difference]: Start difference. First operand 277 states and 383 transitions. Second operand has 25 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 17 states have internal predecessors, (83), 12 states have call successors, (16), 10 states have call predecessors, (16), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 21:09:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:42,106 INFO L93 Difference]: Finished difference Result 602 states and 876 transitions. [2024-10-14 21:09:42,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 21:09:42,107 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 17 states have internal predecessors, (83), 12 states have call successors, (16), 10 states have call predecessors, (16), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 84 [2024-10-14 21:09:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:42,109 INFO L225 Difference]: With dead ends: 602 [2024-10-14 21:09:42,109 INFO L226 Difference]: Without dead ends: 339 [2024-10-14 21:09:42,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 145 SyntacticMatches, 18 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=997, Unknown=0, NotChecked=0, Total=1260 [2024-10-14 21:09:42,112 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 294 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:42,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 421 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:09:42,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-10-14 21:09:42,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 307. [2024-10-14 21:09:42,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 242 states have (on average 1.0950413223140496) internal successors, (265), 240 states have internal predecessors, (265), 39 states have call successors, (39), 11 states have call predecessors, (39), 24 states have return successors, (124), 55 states have call predecessors, (124), 38 states have call successors, (124) [2024-10-14 21:09:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 428 transitions. [2024-10-14 21:09:42,128 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 428 transitions. Word has length 84 [2024-10-14 21:09:42,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:42,129 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 428 transitions. [2024-10-14 21:09:42,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 17 states have internal predecessors, (83), 12 states have call successors, (16), 10 states have call predecessors, (16), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 21:09:42,129 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 428 transitions. [2024-10-14 21:09:42,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 21:09:42,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:42,131 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 21:09:42,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 21:09:42,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:42,335 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:09:42,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:42,336 INFO L85 PathProgramCache]: Analyzing trace with hash -736975495, now seen corresponding path program 2 times [2024-10-14 21:09:42,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:42,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658779554] [2024-10-14 21:09:42,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:42,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:42,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 21:09:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:42,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 21:09:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:42,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:42,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 21:09:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:42,403 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-10-14 21:09:42,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:42,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658779554] [2024-10-14 21:09:42,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658779554] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:09:42,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404764350] [2024-10-14 21:09:42,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:09:42,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:42,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:42,406 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) [2024-10-14 21:09:42,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 21:09:42,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:09:42,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:09:42,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 21:09:42,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-10-14 21:09:42,467 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:09:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-10-14 21:09:42,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404764350] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:09:42,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:09:42,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-10-14 21:09:42,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138901945] [2024-10-14 21:09:42,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:09:42,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 21:09:42,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:42,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 21:09:42,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 21:09:42,511 INFO L87 Difference]: Start difference. First operand 307 states and 428 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 21:09:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:42,558 INFO L93 Difference]: Finished difference Result 328 states and 453 transitions. [2024-10-14 21:09:42,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 21:09:42,558 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 85 [2024-10-14 21:09:42,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:42,561 INFO L225 Difference]: With dead ends: 328 [2024-10-14 21:09:42,561 INFO L226 Difference]: Without dead ends: 327 [2024-10-14 21:09:42,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:09:42,563 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:42,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 107 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:09:42,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-14 21:09:42,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 307. [2024-10-14 21:09:42,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 242 states have (on average 1.0950413223140496) internal successors, (265), 240 states have internal predecessors, (265), 39 states have call successors, (39), 11 states have call predecessors, (39), 24 states have return successors, (124), 55 states have call predecessors, (124), 38 states have call successors, (124) [2024-10-14 21:09:42,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 428 transitions. [2024-10-14 21:09:42,583 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 428 transitions. Word has length 85 [2024-10-14 21:09:42,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:42,583 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 428 transitions. [2024-10-14 21:09:42,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 21:09:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 428 transitions. [2024-10-14 21:09:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 21:09:42,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:42,586 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 21:09:42,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 21:09:42,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:42,787 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:09:42,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:42,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1371403811, now seen corresponding path program 1 times [2024-10-14 21:09:42,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:42,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715268983] [2024-10-14 21:09:42,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:42,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:43,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 21:09:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:43,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 21:09:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:43,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:43,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 21:09:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:43,082 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 183 proven. 116 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 21:09:43,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:43,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715268983] [2024-10-14 21:09:43,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715268983] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:09:43,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432981020] [2024-10-14 21:09:43,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:43,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:43,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:43,084 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) [2024-10-14 21:09:43,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 21:09:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:43,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 21:09:43,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 179 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 21:09:43,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:09:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 179 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 21:09:43,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432981020] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:09:43,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:09:43,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 26 [2024-10-14 21:09:43,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492941959] [2024-10-14 21:09:43,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:09:43,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 21:09:43,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:43,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 21:09:43,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2024-10-14 21:09:43,462 INFO L87 Difference]: Start difference. First operand 307 states and 428 transitions. Second operand has 26 states, 25 states have (on average 3.12) internal successors, (78), 18 states have internal predecessors, (78), 12 states have call successors, (14), 9 states have call predecessors, (14), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-14 21:09:43,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:43,995 INFO L93 Difference]: Finished difference Result 489 states and 683 transitions. [2024-10-14 21:09:43,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-14 21:09:43,996 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.12) internal successors, (78), 18 states have internal predecessors, (78), 12 states have call successors, (14), 9 states have call predecessors, (14), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 86 [2024-10-14 21:09:43,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:43,997 INFO L225 Difference]: With dead ends: 489 [2024-10-14 21:09:43,997 INFO L226 Difference]: Without dead ends: 184 [2024-10-14 21:09:43,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 166 SyntacticMatches, 18 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=825, Invalid=2367, Unknown=0, NotChecked=0, Total=3192 [2024-10-14 21:09:44,000 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 581 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:44,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 143 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:09:44,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-14 21:09:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2024-10-14 21:09:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.1317829457364341) internal successors, (146), 129 states have internal predecessors, (146), 21 states have call successors, (21), 13 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 21:09:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 187 transitions. [2024-10-14 21:09:44,006 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 187 transitions. Word has length 86 [2024-10-14 21:09:44,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:44,006 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 187 transitions. [2024-10-14 21:09:44,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.12) internal successors, (78), 18 states have internal predecessors, (78), 12 states have call successors, (14), 9 states have call predecessors, (14), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-14 21:09:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 187 transitions. [2024-10-14 21:09:44,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 21:09:44,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:44,007 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 21:09:44,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 21:09:44,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:44,212 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:09:44,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:44,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1334176510, now seen corresponding path program 2 times [2024-10-14 21:09:44,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:44,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352277432] [2024-10-14 21:09:44,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:44,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:44,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 21:09:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:44,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:44,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:09:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:44,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 21:09:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-14 21:09:44,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:44,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352277432] [2024-10-14 21:09:44,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352277432] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:09:44,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788767797] [2024-10-14 21:09:44,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:09:44,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:44,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:44,324 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) [2024-10-14 21:09:44,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 21:09:44,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:09:44,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:09:44,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 21:09:44,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2024-10-14 21:09:44,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:09:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-14 21:09:44,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788767797] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:09:44,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:09:44,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2024-10-14 21:09:44,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095566791] [2024-10-14 21:09:44,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:09:44,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 21:09:44,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:44,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 21:09:44,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-14 21:09:44,539 INFO L87 Difference]: Start difference. First operand 163 states and 187 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 21:09:44,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:44,590 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2024-10-14 21:09:44,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 21:09:44,592 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2024-10-14 21:09:44,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:44,593 INFO L225 Difference]: With dead ends: 164 [2024-10-14 21:09:44,593 INFO L226 Difference]: Without dead ends: 163 [2024-10-14 21:09:44,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 161 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-14 21:09:44,593 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:44,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 125 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:09:44,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-14 21:09:44,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-14 21:09:44,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.1162790697674418) internal successors, (144), 129 states have internal predecessors, (144), 21 states have call successors, (21), 13 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 21:09:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 185 transitions. [2024-10-14 21:09:44,603 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 185 transitions. Word has length 80 [2024-10-14 21:09:44,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:44,603 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 185 transitions. [2024-10-14 21:09:44,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 21:09:44,604 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 185 transitions. [2024-10-14 21:09:44,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 21:09:44,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:44,604 INFO L215 NwaCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1] [2024-10-14 21:09:44,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 21:09:44,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:44,809 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:09:44,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:44,809 INFO L85 PathProgramCache]: Analyzing trace with hash -40645547, now seen corresponding path program 3 times [2024-10-14 21:09:44,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:44,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963493613] [2024-10-14 21:09:44,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:44,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:44,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 21:09:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:44,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:44,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:44,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:09:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:09:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 21:09:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:09:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 35 proven. 23 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-10-14 21:09:45,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:45,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963493613] [2024-10-14 21:09:45,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963493613] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:09:45,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343500957] [2024-10-14 21:09:45,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 21:09:45,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:45,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:45,040 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) [2024-10-14 21:09:45,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 21:09:45,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-14 21:09:45,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:09:45,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 21:09:45,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:45,133 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2024-10-14 21:09:45,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:09:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2024-10-14 21:09:45,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343500957] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:09:45,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:09:45,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2024-10-14 21:09:45,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627679550] [2024-10-14 21:09:45,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:09:45,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 21:09:45,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:45,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 21:09:45,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-14 21:09:45,270 INFO L87 Difference]: Start difference. First operand 163 states and 185 transitions. Second operand has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-14 21:09:45,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:45,325 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2024-10-14 21:09:45,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 21:09:45,325 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) Word has length 112 [2024-10-14 21:09:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:45,326 INFO L225 Difference]: With dead ends: 163 [2024-10-14 21:09:45,326 INFO L226 Difference]: Without dead ends: 162 [2024-10-14 21:09:45,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 237 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 21:09:45,327 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:45,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 110 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:09:45,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-14 21:09:45,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-14 21:09:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 129 states have (on average 1.054263565891473) internal successors, (136), 128 states have internal predecessors, (136), 21 states have call successors, (21), 13 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 21:09:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 177 transitions. [2024-10-14 21:09:45,334 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 177 transitions. Word has length 112 [2024-10-14 21:09:45,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:45,334 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 177 transitions. [2024-10-14 21:09:45,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-14 21:09:45,334 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 177 transitions. [2024-10-14 21:09:45,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-14 21:09:45,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:45,335 INFO L215 NwaCegarLoop]: trace histogram [19, 16, 14, 11, 11, 11, 11, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 3, 1, 1, 1] [2024-10-14 21:09:45,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 21:09:45,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-14 21:09:45,536 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:09:45,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:45,536 INFO L85 PathProgramCache]: Analyzing trace with hash 767646059, now seen corresponding path program 3 times [2024-10-14 21:09:45,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:45,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170762736] [2024-10-14 21:09:45,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:45,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 21:09:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:09:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:09:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:09:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:09:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 21:09:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:09:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:09:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:45,981 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 78 proven. 135 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2024-10-14 21:09:45,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:45,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170762736] [2024-10-14 21:09:45,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170762736] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:09:45,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949782299] [2024-10-14 21:09:45,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 21:09:45,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:45,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:45,983 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) [2024-10-14 21:09:45,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 21:09:46,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-14 21:09:46,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:09:46,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-14 21:09:46,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 78 proven. 135 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2024-10-14 21:09:46,184 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:09:47,097 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 144 proven. 128 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 21:09:47,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949782299] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:09:47,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:09:47,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 26 [2024-10-14 21:09:47,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045520642] [2024-10-14 21:09:47,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:09:47,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 21:09:47,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:47,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 21:09:47,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2024-10-14 21:09:47,099 INFO L87 Difference]: Start difference. First operand 162 states and 177 transitions. Second operand has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 states have internal predecessors, (70), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2024-10-14 21:09:47,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:47,167 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2024-10-14 21:09:47,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 21:09:47,168 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 states have internal predecessors, (70), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) Word has length 166 [2024-10-14 21:09:47,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:47,169 INFO L225 Difference]: With dead ends: 163 [2024-10-14 21:09:47,169 INFO L226 Difference]: Without dead ends: 162 [2024-10-14 21:09:47,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 346 SyntacticMatches, 16 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2024-10-14 21:09:47,170 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:47,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 201 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:09:47,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-14 21:09:47,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-14 21:09:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 129 states have (on average 1.0232558139534884) internal successors, (132), 128 states have internal predecessors, (132), 21 states have call successors, (21), 13 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 21:09:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2024-10-14 21:09:47,176 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 166 [2024-10-14 21:09:47,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:47,176 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2024-10-14 21:09:47,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 states have internal predecessors, (70), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2024-10-14 21:09:47,176 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2024-10-14 21:09:47,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-10-14 21:09:47,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:47,179 INFO L215 NwaCegarLoop]: trace histogram [43, 40, 35, 22, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 20, 19, 13, 8, 1, 1, 1] [2024-10-14 21:09:47,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-14 21:09:47,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-14 21:09:47,383 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:09:47,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:47,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2100659218, now seen corresponding path program 4 times [2024-10-14 21:09:47,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:47,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856039443] [2024-10-14 21:09:47,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:47,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:48,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 21:09:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:48,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:48,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:48,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:48,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:09:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:09:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:09:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:09:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 21:09:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:09:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:09:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 21:09:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:09:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:09:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:09:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:09:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-10-14 21:09:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:09:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:09:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:09:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:09:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 21:09:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:09:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:09:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:09:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2024-10-14 21:09:49,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:49,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856039443] [2024-10-14 21:09:49,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856039443] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:09:49,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126439579] [2024-10-14 21:09:49,429 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 21:09:49,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:49,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:49,430 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) [2024-10-14 21:09:49,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 21:09:49,556 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 21:09:49,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:09:49,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-10-14 21:09:49,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2024-10-14 21:09:49,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:09:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 1149 proven. 1015 refuted. 0 times theorem prover too weak. 3820 trivial. 0 not checked. [2024-10-14 21:09:55,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126439579] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:09:55,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:09:55,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 29] total 40 [2024-10-14 21:09:55,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591861602] [2024-10-14 21:09:55,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:09:55,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-14 21:09:55,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:55,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-14 21:09:55,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 21:09:55,303 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand has 41 states, 40 states have (on average 2.6) internal successors, (104), 41 states have internal predecessors, (104), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) [2024-10-14 21:09:55,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:55,380 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2024-10-14 21:09:55,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 21:09:55,381 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.6) internal successors, (104), 41 states have internal predecessors, (104), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) Word has length 409 [2024-10-14 21:09:55,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:55,382 INFO L225 Difference]: With dead ends: 163 [2024-10-14 21:09:55,382 INFO L226 Difference]: Without dead ends: 162 [2024-10-14 21:09:55,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 978 GetRequests, 876 SyntacticMatches, 62 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2223 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2024-10-14 21:09:55,383 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:55,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 184 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:09:55,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-14 21:09:55,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-14 21:09:55,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 129 states have (on average 1.0077519379844961) internal successors, (130), 128 states have internal predecessors, (130), 21 states have call successors, (21), 13 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 21:09:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions. [2024-10-14 21:09:55,389 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 409 [2024-10-14 21:09:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:55,390 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 171 transitions. [2024-10-14 21:09:55,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.6) internal successors, (104), 41 states have internal predecessors, (104), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) [2024-10-14 21:09:55,390 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2024-10-14 21:09:55,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1065 [2024-10-14 21:09:55,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:55,405 INFO L215 NwaCegarLoop]: trace histogram [109, 108, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 34, 21, 1, 1, 1] [2024-10-14 21:09:55,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-14 21:09:55,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-14 21:09:55,610 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:09:55,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:55,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2126609436, now seen corresponding path program 5 times [2024-10-14 21:09:55,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:55,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931731307] [2024-10-14 21:09:55,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:55,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:01,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:10:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:02,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:10:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:10:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 21:10:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:10:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 21:10:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:10:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:10:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-14 21:10:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:10:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:10:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 21:10:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:10:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:03,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 406 [2024-10-14 21:10:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:10:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:10:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 21:10:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:10:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 21:10:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:10:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:10:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 663 [2024-10-14 21:10:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:04,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:10:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:10:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 21:10:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:10:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 21:10:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:10:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:10:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-14 21:10:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:10:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:10:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 21:10:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:10:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:10:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:10:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 6686 proven. 7855 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2024-10-14 21:10:05,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:10:05,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931731307] [2024-10-14 21:10:05,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931731307] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:10:05,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445427440] [2024-10-14 21:10:05,558 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 21:10:05,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:10:05,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:10:05,560 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) [2024-10-14 21:10:05,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 21:10:05,974 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 83 check-sat command(s) [2024-10-14 21:10:05,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:10:05,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 1988 conjuncts, 217 conjuncts are in the unsatisfiable core [2024-10-14 21:10:05,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:10:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 6686 proven. 7855 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2024-10-14 21:10:06,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:10:40,766 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 7863 proven. 7392 refuted. 0 times theorem prover too weak. 26211 trivial. 0 not checked. [2024-10-14 21:10:40,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445427440] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:10:40,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:10:40,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 41] total 54 [2024-10-14 21:10:40,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650002301] [2024-10-14 21:10:40,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:10:40,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-14 21:10:40,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:10:40,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-14 21:10:40,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=642, Invalid=2328, Unknown=0, NotChecked=0, Total=2970 [2024-10-14 21:10:40,769 INFO L87 Difference]: Start difference. First operand 162 states and 171 transitions. Second operand has 55 states, 54 states have (on average 2.5555555555555554) internal successors, (138), 55 states have internal predecessors, (138), 15 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (38), 38 states have call predecessors, (38), 15 states have call successors, (38) [2024-10-14 21:10:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:10:40,847 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2024-10-14 21:10:40,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 21:10:40,848 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.5555555555555554) internal successors, (138), 55 states have internal predecessors, (138), 15 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (38), 38 states have call predecessors, (38), 15 states have call successors, (38) Word has length 1064 [2024-10-14 21:10:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:10:40,849 INFO L225 Difference]: With dead ends: 162 [2024-10-14 21:10:40,850 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 21:10:40,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2559 GetRequests, 2314 SyntacticMatches, 192 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7369 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=642, Invalid=2328, Unknown=0, NotChecked=0, Total=2970 [2024-10-14 21:10:40,851 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:10:40,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:10:40,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 21:10:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 21:10:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:10:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 21:10:40,852 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1064 [2024-10-14 21:10:40,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:10:40,852 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 21:10:40,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.5555555555555554) internal successors, (138), 55 states have internal predecessors, (138), 15 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (38), 38 states have call predecessors, (38), 15 states have call successors, (38) [2024-10-14 21:10:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 21:10:40,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 21:10:40,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-14 21:10:40,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-14 21:10:40,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-14 21:10:40,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-14 21:10:40,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-14 21:10:40,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-14 21:10:40,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-14 21:10:41,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 21:10:41,059 INFO L407 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1] [2024-10-14 21:10:41,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 21:10:41,874 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 21:10:41,904 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 21:10:41,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:10:41 BoogieIcfgContainer [2024-10-14 21:10:41,905 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 21:10:41,906 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 21:10:41,906 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 21:10:41,906 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 21:10:41,906 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:09:37" (3/4) ... [2024-10-14 21:10:41,907 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 21:10:41,910 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2024-10-14 21:10:41,914 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-14 21:10:41,914 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 21:10:41,914 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 21:10:41,914 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 21:10:41,982 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 21:10:41,983 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 21:10:41,983 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 21:10:41,983 INFO L158 Benchmark]: Toolchain (without parser) took 65322.90ms. Allocated memory was 125.8MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 57.0MB in the beginning and 819.9MB in the end (delta: -762.9MB). Peak memory consumption was 404.1MB. Max. memory is 16.1GB. [2024-10-14 21:10:41,983 INFO L158 Benchmark]: CDTParser took 1.16ms. Allocated memory is still 125.8MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 21:10:41,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.24ms. Allocated memory was 125.8MB in the beginning and 167.8MB in the end (delta: 41.9MB). Free memory was 56.7MB in the beginning and 133.4MB in the end (delta: -76.6MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-10-14 21:10:41,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.63ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 131.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 21:10:41,984 INFO L158 Benchmark]: Boogie Preprocessor took 30.78ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 130.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 21:10:41,984 INFO L158 Benchmark]: RCFGBuilder took 217.90ms. Allocated memory is still 167.8MB. Free memory was 130.4MB in the beginning and 119.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 21:10:41,985 INFO L158 Benchmark]: TraceAbstraction took 64763.16ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 118.5MB in the beginning and 824.1MB in the end (delta: -705.6MB). Peak memory consumption was 418.4MB. Max. memory is 16.1GB. [2024-10-14 21:10:41,985 INFO L158 Benchmark]: Witness Printer took 77.28ms. Allocated memory is still 1.3GB. Free memory was 824.1MB in the beginning and 819.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 21:10:41,986 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16ms. Allocated memory is still 125.8MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.24ms. Allocated memory was 125.8MB in the beginning and 167.8MB in the end (delta: 41.9MB). Free memory was 56.7MB in the beginning and 133.4MB in the end (delta: -76.6MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.63ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 131.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.78ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 130.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 217.90ms. Allocated memory is still 167.8MB. Free memory was 130.4MB in the beginning and 119.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 64763.16ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 118.5MB in the beginning and 824.1MB in the end (delta: -705.6MB). Peak memory consumption was 418.4MB. Max. memory is 16.1GB. * Witness Printer took 77.28ms. Allocated memory is still 1.3GB. Free memory was 824.1MB in the beginning and 819.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 63.9s, OverallIterations: 15, TraceHistogramMax: 109, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1346 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1321 mSDsluCounter, 2503 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2102 mSDsCounter, 327 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3409 IncrementalHoareTripleChecker+Invalid, 3736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 327 mSolverCounterUnsat, 401 mSDtfsCounter, 3409 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5244 GetRequests, 4599 SyntacticMatches, 317 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11923 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=8, InterpolantAutomatonStates: 225, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 149 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 57.1s InterpolantComputationTime, 4498 NumberOfCodeBlocks, 4405 NumberOfCodeBlocksAsserted, 126 NumberOfCheckSat, 6619 ConstructedInterpolants, 0 QuantifiedInterpolants, 15418 SizeOfPredicates, 24 NumberOfNonLiveVariables, 4103 ConjunctsInSsa, 412 ConjunctsInUnsatCore, 36 InterpolantComputations, 5 PerfectInterpolantSequences, 122928/150724 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - ProcedureContractResult [Line: 16]: Procedure Contract for fibonacci Derived contract for procedure fibonacci. Requires: (n <= 9) Ensures: ((n <= 9) && ((\result == 0) || (0 < n))) RESULT: Ultimate proved your program to be correct! [2024-10-14 21:10:42,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE