./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_2-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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 ../sv-benchmarks/c/recursive-simple/fibo_2calls_2-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6597d5a31aa324ba443314d2c363b302cd71d697c12811ade53ae3225a095206 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:15:04,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:15:04,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:15:04,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:15:04,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:15:04,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:15:04,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:15:04,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:15:04,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:15:04,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:15:04,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:15:04,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:15:04,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:15:04,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:15:04,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:15:04,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:15:04,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:15:04,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:15:04,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:15:04,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:15:04,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:15:04,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:15:04,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:15:04,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:15:04,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:15:04,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:15:04,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:15:04,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:15:04,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:15:04,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:15:04,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:15:04,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:15:04,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:15:04,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:15:04,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:15:04,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:15:04,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:15:04,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:15:04,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:15:04,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:15:04,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:15:04,409 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:15:04,432 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:15:04,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:15:04,432 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:15:04,432 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:15:04,433 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:15:04,434 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:15:04,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:15:04,435 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:15:04,435 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:15:04,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:15:04,436 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:15:04,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:15:04,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:15:04,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:15:04,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:15:04,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:15:04,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:15:04,437 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:15:04,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:15:04,437 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:15:04,437 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:15:04,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:15:04,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:15:04,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:15:04,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:15:04,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:15:04,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:15:04,439 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:15:04,439 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:15:04,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:15:04,439 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:15:04,439 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:15:04,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:15:04,440 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 ! call(reach_error())) ) 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 -> 6597d5a31aa324ba443314d2c363b302cd71d697c12811ade53ae3225a095206 [2022-02-20 18:15:04,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:15:04,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:15:04,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:15:04,701 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:15:04,702 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:15:04,703 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_2-2.c [2022-02-20 18:15:04,766 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ee39f7b/3232aa1b0d9b482fba2e8b7231079464/FLAG05f5f8943 [2022-02-20 18:15:05,129 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:15:05,129 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_2-2.c [2022-02-20 18:15:05,137 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ee39f7b/3232aa1b0d9b482fba2e8b7231079464/FLAG05f5f8943 [2022-02-20 18:15:05,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ee39f7b/3232aa1b0d9b482fba2e8b7231079464 [2022-02-20 18:15:05,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:15:05,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:15:05,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:15:05,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:15:05,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:15:05,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:15:05" (1/1) ... [2022-02-20 18:15:05,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@606d5b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:05, skipping insertion in model container [2022-02-20 18:15:05,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:15:05" (1/1) ... [2022-02-20 18:15:05,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:15:05,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:15:05,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_2-2.c[946,959] [2022-02-20 18:15:05,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:15:05,374 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:15:05,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_2-2.c[946,959] [2022-02-20 18:15:05,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:15:05,404 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:15:05,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:05 WrapperNode [2022-02-20 18:15:05,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:15:05,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:15:05,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:15:05,406 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:15:05,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:05" (1/1) ... [2022-02-20 18:15:05,416 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:05" (1/1) ... [2022-02-20 18:15:05,429 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-02-20 18:15:05,430 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:15:05,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:15:05,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:15:05,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:15:05,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:05" (1/1) ... [2022-02-20 18:15:05,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:05" (1/1) ... [2022-02-20 18:15:05,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:05" (1/1) ... [2022-02-20 18:15:05,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:05" (1/1) ... [2022-02-20 18:15:05,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:05" (1/1) ... [2022-02-20 18:15:05,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:05" (1/1) ... [2022-02-20 18:15:05,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:05" (1/1) ... [2022-02-20 18:15:05,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:15:05,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:15:05,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:15:05,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:15:05,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:05" (1/1) ... [2022-02-20 18:15:05,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:15:05,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:15:05,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:15:05,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:15:05,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:15:05,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:15:05,532 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-02-20 18:15:05,532 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-02-20 18:15:05,532 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-02-20 18:15:05,532 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-02-20 18:15:05,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:15:05,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:15:05,575 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:15:05,576 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:15:05,683 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:15:05,690 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:15:05,691 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:15:05,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:15:05 BoogieIcfgContainer [2022-02-20 18:15:05,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:15:05,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:15:05,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:15:05,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:15:05,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:15:05" (1/3) ... [2022-02-20 18:15:05,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f024bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:15:05, skipping insertion in model container [2022-02-20 18:15:05,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:05" (2/3) ... [2022-02-20 18:15:05,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f024bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:15:05, skipping insertion in model container [2022-02-20 18:15:05,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:15:05" (3/3) ... [2022-02-20 18:15:05,701 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-2.c [2022-02-20 18:15:05,706 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:15:05,707 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:15:05,750 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:15:05,758 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:15:05,759 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:15:05,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 18:15:05,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 18:15:05,793 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:05,794 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:05,795 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:05,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:05,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2022-02-20 18:15:05,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:05,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531852694] [2022-02-20 18:15:05,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:05,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:05,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:06,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~n := #in~n; {39#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:06,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {40#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:06,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#(<= |fibo1_#in~n| 0)} assume true; {40#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:06,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#(<= |fibo1_#in~n| 0)} {34#(= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {33#false} is VALID [2022-02-20 18:15:06,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-02-20 18:15:06,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2; {34#(= 2 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:06,006 INFO L272 TraceCheckUtils]: 2: Hoare triple {34#(= 2 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {32#true} is VALID [2022-02-20 18:15:06,006 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#true} ~n := #in~n; {39#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:06,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {39#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {40#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:06,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#(<= |fibo1_#in~n| 0)} assume true; {40#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:06,024 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {40#(<= |fibo1_#in~n| 0)} {34#(= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {33#false} is VALID [2022-02-20 18:15:06,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {33#false} is VALID [2022-02-20 18:15:06,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#false} assume 1 != main_~result~0#1; {33#false} is VALID [2022-02-20 18:15:06,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-02-20 18:15:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:15:06,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:06,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531852694] [2022-02-20 18:15:06,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531852694] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:15:06,027 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:15:06,027 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:15:06,029 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181016405] [2022-02-20 18:15:06,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:15:06,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-02-20 18:15:06,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:06,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:15:06,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:06,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:15:06,064 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:06,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:15:06,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:15:06,084 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:15:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:06,292 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-02-20 18:15:06,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:15:06,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-02-20 18:15:06,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:15:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-02-20 18:15:06,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:15:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-02-20 18:15:06,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-02-20 18:15:06,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:06,371 INFO L225 Difference]: With dead ends: 39 [2022-02-20 18:15:06,372 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 18:15:06,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:15:06,380 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:06,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 89 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:15:06,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 18:15:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 18:15:06,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:06,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:06,407 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:06,407 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:06,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:06,411 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-20 18:15:06,411 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 18:15:06,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:06,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:06,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Second operand 27 states. [2022-02-20 18:15:06,412 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Second operand 27 states. [2022-02-20 18:15:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:06,415 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-20 18:15:06,415 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 18:15:06,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:06,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:06,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:06,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:06,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:06,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-02-20 18:15:06,420 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2022-02-20 18:15:06,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:06,420 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-02-20 18:15:06,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:15:06,421 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 18:15:06,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 18:15:06,421 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:06,422 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:06,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:15:06,422 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:06,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:06,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2022-02-20 18:15:06,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:06,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239040657] [2022-02-20 18:15:06,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:06,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:06,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:06,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {181#true} ~n := #in~n; {189#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:06,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {189#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:06,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {190#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:06,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {190#(<= |fibo1_#in~n| 1)} assume true; {190#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:06,496 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {190#(<= |fibo1_#in~n| 1)} {183#(= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {182#false} is VALID [2022-02-20 18:15:06,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {181#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {181#true} is VALID [2022-02-20 18:15:06,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2; {183#(= 2 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:06,497 INFO L272 TraceCheckUtils]: 2: Hoare triple {183#(= 2 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {181#true} is VALID [2022-02-20 18:15:06,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {181#true} ~n := #in~n; {189#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:06,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {189#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {189#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:06,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {190#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:06,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {190#(<= |fibo1_#in~n| 1)} assume true; {190#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:06,500 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {190#(<= |fibo1_#in~n| 1)} {183#(= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {182#false} is VALID [2022-02-20 18:15:06,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {182#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {182#false} is VALID [2022-02-20 18:15:06,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#false} assume 1 != main_~result~0#1; {182#false} is VALID [2022-02-20 18:15:06,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {182#false} assume !false; {182#false} is VALID [2022-02-20 18:15:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:15:06,501 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:06,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239040657] [2022-02-20 18:15:06,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239040657] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:15:06,502 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:15:06,502 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:15:06,502 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560513798] [2022-02-20 18:15:06,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:15:06,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 18:15:06,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:06,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:15:06,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:06,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:15:06,520 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:06,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:15:06,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:15:06,521 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:15:06,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:06,635 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 18:15:06,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:15:06,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 18:15:06,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:15:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-20 18:15:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:15:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-20 18:15:06,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-02-20 18:15:06,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:06,671 INFO L225 Difference]: With dead ends: 33 [2022-02-20 18:15:06,671 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 18:15:06,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:15:06,677 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:06,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 77 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:15:06,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 18:15:06,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-02-20 18:15:06,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:06,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:06,681 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:06,681 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:06,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:06,683 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-20 18:15:06,683 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-20 18:15:06,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:06,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:06,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Second operand 29 states. [2022-02-20 18:15:06,684 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Second operand 29 states. [2022-02-20 18:15:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:06,686 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-20 18:15:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-20 18:15:06,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:06,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:06,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:06,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-02-20 18:15:06,688 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2022-02-20 18:15:06,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:06,688 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-02-20 18:15:06,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:15:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 18:15:06,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 18:15:06,689 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:06,689 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:06,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:15:06,689 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:06,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:06,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2022-02-20 18:15:06,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:06,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500038686] [2022-02-20 18:15:06,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:06,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:06,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:06,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:06,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~n := #in~n; {357#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:06,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:06,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {358#(<= |fibo2_#in~n| 0)} assume true; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:06,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {358#(<= |fibo2_#in~n| 0)} {348#(not (<= fibo1_~n 1))} #53#return; {328#false} is VALID [2022-02-20 18:15:06,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 18:15:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:06,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:06,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume ~n < 1;#res := 0; {327#true} is VALID [2022-02-20 18:15:06,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 18:15:06,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {328#false} #55#return; {328#false} is VALID [2022-02-20 18:15:06,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:06,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume !(~n < 1); {347#(< 0 fibo1_~n)} is VALID [2022-02-20 18:15:06,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#(< 0 fibo1_~n)} assume !(1 == ~n); {348#(not (<= fibo1_~n 1))} is VALID [2022-02-20 18:15:06,827 INFO L272 TraceCheckUtils]: 3: Hoare triple {348#(not (<= fibo1_~n 1))} call #t~ret4 := fibo2(~n - 1); {327#true} is VALID [2022-02-20 18:15:06,827 INFO L290 TraceCheckUtils]: 4: Hoare triple {327#true} ~n := #in~n; {357#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:06,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {357#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:06,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {358#(<= |fibo2_#in~n| 0)} assume true; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:06,829 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {358#(<= |fibo2_#in~n| 0)} {348#(not (<= fibo1_~n 1))} #53#return; {328#false} is VALID [2022-02-20 18:15:06,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {328#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {328#false} is VALID [2022-02-20 18:15:06,829 INFO L272 TraceCheckUtils]: 9: Hoare triple {328#false} call #t~ret5 := fibo2(~n - 2); {327#true} is VALID [2022-02-20 18:15:06,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:06,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {327#true} assume ~n < 1;#res := 0; {327#true} is VALID [2022-02-20 18:15:06,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 18:15:06,835 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {327#true} {328#false} #55#return; {328#false} is VALID [2022-02-20 18:15:06,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {328#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {328#false} is VALID [2022-02-20 18:15:06,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {328#false} assume true; {328#false} is VALID [2022-02-20 18:15:06,835 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {328#false} {329#(= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {328#false} is VALID [2022-02-20 18:15:06,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {327#true} is VALID [2022-02-20 18:15:06,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2; {329#(= 2 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:06,837 INFO L272 TraceCheckUtils]: 2: Hoare triple {329#(= 2 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {327#true} is VALID [2022-02-20 18:15:06,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:06,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {327#true} assume !(~n < 1); {347#(< 0 fibo1_~n)} is VALID [2022-02-20 18:15:06,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#(< 0 fibo1_~n)} assume !(1 == ~n); {348#(not (<= fibo1_~n 1))} is VALID [2022-02-20 18:15:06,841 INFO L272 TraceCheckUtils]: 6: Hoare triple {348#(not (<= fibo1_~n 1))} call #t~ret4 := fibo2(~n - 1); {327#true} is VALID [2022-02-20 18:15:06,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} ~n := #in~n; {357#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:06,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {357#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:06,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {358#(<= |fibo2_#in~n| 0)} assume true; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:06,843 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {358#(<= |fibo2_#in~n| 0)} {348#(not (<= fibo1_~n 1))} #53#return; {328#false} is VALID [2022-02-20 18:15:06,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {328#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {328#false} is VALID [2022-02-20 18:15:06,843 INFO L272 TraceCheckUtils]: 12: Hoare triple {328#false} call #t~ret5 := fibo2(~n - 2); {327#true} is VALID [2022-02-20 18:15:06,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:06,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} assume ~n < 1;#res := 0; {327#true} is VALID [2022-02-20 18:15:06,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 18:15:06,844 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {327#true} {328#false} #55#return; {328#false} is VALID [2022-02-20 18:15:06,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {328#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {328#false} is VALID [2022-02-20 18:15:06,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {328#false} assume true; {328#false} is VALID [2022-02-20 18:15:06,844 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {328#false} {329#(= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {328#false} is VALID [2022-02-20 18:15:06,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {328#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {328#false} is VALID [2022-02-20 18:15:06,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {328#false} assume 1 != main_~result~0#1; {328#false} is VALID [2022-02-20 18:15:06,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-02-20 18:15:06,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:15:06,845 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:06,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500038686] [2022-02-20 18:15:06,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500038686] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:15:06,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088501314] [2022-02-20 18:15:06,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:06,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:06,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:15:06,848 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) [2022-02-20 18:15:06,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 18:15:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:06,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 18:15:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:06,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:15:07,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {327#true} is VALID [2022-02-20 18:15:07,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2; {365#(<= 2 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:07,126 INFO L272 TraceCheckUtils]: 2: Hoare triple {365#(<= 2 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {327#true} is VALID [2022-02-20 18:15:07,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {327#true} ~n := #in~n; {372#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:07,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {372#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {372#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:07,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {372#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {372#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:07,128 INFO L272 TraceCheckUtils]: 6: Hoare triple {372#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {327#true} is VALID [2022-02-20 18:15:07,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} ~n := #in~n; {385#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-20 18:15:07,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {385#(<= |fibo2_#in~n| fibo2_~n)} assume ~n < 1;#res := 0; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:07,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {358#(<= |fibo2_#in~n| 0)} assume true; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:07,131 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {358#(<= |fibo2_#in~n| 0)} {372#(<= |fibo1_#in~n| fibo1_~n)} #53#return; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:07,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {395#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:07,132 INFO L272 TraceCheckUtils]: 12: Hoare triple {395#(<= |fibo1_#in~n| 1)} call #t~ret5 := fibo2(~n - 2); {327#true} is VALID [2022-02-20 18:15:07,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:07,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} assume ~n < 1;#res := 0; {327#true} is VALID [2022-02-20 18:15:07,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 18:15:07,133 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {327#true} {395#(<= |fibo1_#in~n| 1)} #55#return; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:07,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {395#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:07,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {395#(<= |fibo1_#in~n| 1)} assume true; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:07,134 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {395#(<= |fibo1_#in~n| 1)} {365#(<= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {328#false} is VALID [2022-02-20 18:15:07,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {328#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {328#false} is VALID [2022-02-20 18:15:07,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {328#false} assume 1 != main_~result~0#1; {328#false} is VALID [2022-02-20 18:15:07,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-02-20 18:15:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:15:07,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:15:07,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-02-20 18:15:07,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {328#false} assume 1 != main_~result~0#1; {328#false} is VALID [2022-02-20 18:15:07,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {328#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {328#false} is VALID [2022-02-20 18:15:07,685 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {395#(<= |fibo1_#in~n| 1)} {365#(<= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {328#false} is VALID [2022-02-20 18:15:07,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {395#(<= |fibo1_#in~n| 1)} assume true; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:07,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {395#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:07,690 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {327#true} {395#(<= |fibo1_#in~n| 1)} #55#return; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:07,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 18:15:07,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} assume ~n < 1;#res := 0; {327#true} is VALID [2022-02-20 18:15:07,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:07,691 INFO L272 TraceCheckUtils]: 12: Hoare triple {395#(<= |fibo1_#in~n| 1)} call #t~ret5 := fibo2(~n - 2); {327#true} is VALID [2022-02-20 18:15:07,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {395#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:07,692 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {358#(<= |fibo2_#in~n| 0)} {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} #53#return; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:07,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {358#(<= |fibo2_#in~n| 0)} assume true; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:07,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {481#(or (not (< fibo2_~n 1)) (<= |fibo2_#in~n| 0))} assume ~n < 1;#res := 0; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:07,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} ~n := #in~n; {481#(or (not (< fibo2_~n 1)) (<= |fibo2_#in~n| 0))} is VALID [2022-02-20 18:15:07,702 INFO L272 TraceCheckUtils]: 6: Hoare triple {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} call #t~ret4 := fibo2(~n - 1); {327#true} is VALID [2022-02-20 18:15:07,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} assume !(1 == ~n); {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} is VALID [2022-02-20 18:15:07,703 INFO L290 TraceCheckUtils]: 4: Hoare triple {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} assume !(~n < 1); {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} is VALID [2022-02-20 18:15:07,703 INFO L290 TraceCheckUtils]: 3: Hoare triple {327#true} ~n := #in~n; {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} is VALID [2022-02-20 18:15:07,703 INFO L272 TraceCheckUtils]: 2: Hoare triple {365#(<= 2 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {327#true} is VALID [2022-02-20 18:15:07,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2; {365#(<= 2 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:07,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {327#true} is VALID [2022-02-20 18:15:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:15:07,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088501314] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:15:07,704 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:15:07,705 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 18:15:07,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510223691] [2022-02-20 18:15:07,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:15:07,705 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 7 states have call successors, (7) Word has length 23 [2022-02-20 18:15:07,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:07,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:15:07,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:07,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 18:15:07,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:07,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 18:15:07,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:15:07,735 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:15:08,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:08,175 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2022-02-20 18:15:08,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:15:08,175 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 7 states have call successors, (7) Word has length 23 [2022-02-20 18:15:08,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:08,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:15:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2022-02-20 18:15:08,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:15:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2022-02-20 18:15:08,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 72 transitions. [2022-02-20 18:15:08,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:08,236 INFO L225 Difference]: With dead ends: 55 [2022-02-20 18:15:08,237 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 18:15:08,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:15:08,242 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:08,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 135 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:15:08,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 18:15:08,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-02-20 18:15:08,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:08,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 18:15:08,255 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 18:15:08,255 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 18:15:08,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:08,257 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-02-20 18:15:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-02-20 18:15:08,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:08,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:08,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Second operand 31 states. [2022-02-20 18:15:08,259 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Second operand 31 states. [2022-02-20 18:15:08,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:08,260 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-02-20 18:15:08,260 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-02-20 18:15:08,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:08,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:08,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:08,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 18:15:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-02-20 18:15:08,267 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2022-02-20 18:15:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:08,267 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-02-20 18:15:08,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:15:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-02-20 18:15:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 18:15:08,275 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:08,275 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:08,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 18:15:08,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:08,485 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:08,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:08,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2022-02-20 18:15:08,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:08,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286622592] [2022-02-20 18:15:08,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:08,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:08,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:08,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:08,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#true} ~n := #in~n; {675#true} is VALID [2022-02-20 18:15:08,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} assume !(~n < 1); {675#true} is VALID [2022-02-20 18:15:08,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {675#true} assume 1 == ~n;#res := 1; {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:08,606 INFO L290 TraceCheckUtils]: 3: Hoare triple {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} assume true; {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:08,606 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} {675#true} #53#return; {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:08,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:15:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:08,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#true} ~n := #in~n; {675#true} is VALID [2022-02-20 18:15:08,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} assume ~n < 1;#res := 0; {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:08,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} assume true; {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:08,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} #55#return; {707#(and (<= 1 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 1))} is VALID [2022-02-20 18:15:08,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#true} ~n := #in~n; {675#true} is VALID [2022-02-20 18:15:08,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} assume !(~n < 1); {675#true} is VALID [2022-02-20 18:15:08,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {675#true} assume !(1 == ~n); {675#true} is VALID [2022-02-20 18:15:08,639 INFO L272 TraceCheckUtils]: 3: Hoare triple {675#true} call #t~ret4 := fibo2(~n - 1); {675#true} is VALID [2022-02-20 18:15:08,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {675#true} ~n := #in~n; {675#true} is VALID [2022-02-20 18:15:08,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {675#true} assume !(~n < 1); {675#true} is VALID [2022-02-20 18:15:08,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {675#true} assume 1 == ~n;#res := 1; {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:08,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} assume true; {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:08,641 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} {675#true} #53#return; {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:08,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:08,641 INFO L272 TraceCheckUtils]: 10: Hoare triple {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} call #t~ret5 := fibo2(~n - 2); {675#true} is VALID [2022-02-20 18:15:08,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {675#true} ~n := #in~n; {675#true} is VALID [2022-02-20 18:15:08,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {675#true} assume ~n < 1;#res := 0; {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:08,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} assume true; {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:08,643 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} #55#return; {707#(and (<= 1 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 1))} is VALID [2022-02-20 18:15:08,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {707#(and (<= 1 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {708#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:08,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {708#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {708#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:08,644 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {708#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {675#true} #47#return; {695#(and (<= 1 |ULTIMATE.start_main_#t~ret8#1|) (<= |ULTIMATE.start_main_#t~ret8#1| 1))} is VALID [2022-02-20 18:15:08,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {675#true} is VALID [2022-02-20 18:15:08,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2; {675#true} is VALID [2022-02-20 18:15:08,645 INFO L272 TraceCheckUtils]: 2: Hoare triple {675#true} call main_#t~ret8#1 := fibo1(main_~x~0#1); {675#true} is VALID [2022-02-20 18:15:08,645 INFO L290 TraceCheckUtils]: 3: Hoare triple {675#true} ~n := #in~n; {675#true} is VALID [2022-02-20 18:15:08,645 INFO L290 TraceCheckUtils]: 4: Hoare triple {675#true} assume !(~n < 1); {675#true} is VALID [2022-02-20 18:15:08,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {675#true} assume !(1 == ~n); {675#true} is VALID [2022-02-20 18:15:08,646 INFO L272 TraceCheckUtils]: 6: Hoare triple {675#true} call #t~ret4 := fibo2(~n - 1); {675#true} is VALID [2022-02-20 18:15:08,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {675#true} ~n := #in~n; {675#true} is VALID [2022-02-20 18:15:08,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {675#true} assume !(~n < 1); {675#true} is VALID [2022-02-20 18:15:08,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {675#true} assume 1 == ~n;#res := 1; {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:08,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} assume true; {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:08,647 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} {675#true} #53#return; {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:08,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:08,648 INFO L272 TraceCheckUtils]: 13: Hoare triple {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} call #t~ret5 := fibo2(~n - 2); {675#true} is VALID [2022-02-20 18:15:08,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {675#true} ~n := #in~n; {675#true} is VALID [2022-02-20 18:15:08,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {675#true} assume ~n < 1;#res := 0; {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:08,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} assume true; {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:08,649 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} #55#return; {707#(and (<= 1 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 1))} is VALID [2022-02-20 18:15:08,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {707#(and (<= 1 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {708#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:08,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {708#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {708#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:08,651 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {708#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {675#true} #47#return; {695#(and (<= 1 |ULTIMATE.start_main_#t~ret8#1|) (<= |ULTIMATE.start_main_#t~ret8#1| 1))} is VALID [2022-02-20 18:15:08,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {695#(and (<= 1 |ULTIMATE.start_main_#t~ret8#1|) (<= |ULTIMATE.start_main_#t~ret8#1| 1))} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {696#(and (< 0 |ULTIMATE.start_main_~result~0#1|) (<= |ULTIMATE.start_main_~result~0#1| 1))} is VALID [2022-02-20 18:15:08,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {696#(and (< 0 |ULTIMATE.start_main_~result~0#1|) (<= |ULTIMATE.start_main_~result~0#1| 1))} assume 1 != main_~result~0#1; {676#false} is VALID [2022-02-20 18:15:08,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {676#false} assume !false; {676#false} is VALID [2022-02-20 18:15:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:15:08,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:08,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286622592] [2022-02-20 18:15:08,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286622592] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:15:08,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291215662] [2022-02-20 18:15:08,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:08,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:08,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:15:08,654 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) [2022-02-20 18:15:08,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 18:15:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:08,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 18:15:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:08,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:15:09,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {675#true} is VALID [2022-02-20 18:15:09,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2; {675#true} is VALID [2022-02-20 18:15:09,001 INFO L272 TraceCheckUtils]: 2: Hoare triple {675#true} call main_#t~ret8#1 := fibo1(main_~x~0#1); {675#true} is VALID [2022-02-20 18:15:09,002 INFO L290 TraceCheckUtils]: 3: Hoare triple {675#true} ~n := #in~n; {675#true} is VALID [2022-02-20 18:15:09,003 INFO L290 TraceCheckUtils]: 4: Hoare triple {675#true} assume !(~n < 1); {675#true} is VALID [2022-02-20 18:15:09,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {675#true} assume !(1 == ~n); {675#true} is VALID [2022-02-20 18:15:09,003 INFO L272 TraceCheckUtils]: 6: Hoare triple {675#true} call #t~ret4 := fibo2(~n - 1); {675#true} is VALID [2022-02-20 18:15:09,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {675#true} ~n := #in~n; {675#true} is VALID [2022-02-20 18:15:09,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {675#true} assume !(~n < 1); {675#true} is VALID [2022-02-20 18:15:09,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {675#true} assume 1 == ~n;#res := 1; {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:09,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} assume true; {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:09,007 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} {675#true} #53#return; {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:09,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:09,008 INFO L272 TraceCheckUtils]: 13: Hoare triple {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} call #t~ret5 := fibo2(~n - 2); {675#true} is VALID [2022-02-20 18:15:09,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {675#true} ~n := #in~n; {675#true} is VALID [2022-02-20 18:15:09,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {675#true} assume ~n < 1;#res := 0; {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:09,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} assume true; {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:09,010 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} #55#return; {765#(and (<= |fibo1_#t~ret5| 0) (<= 1 |fibo1_#t~ret4|) (<= 0 |fibo1_#t~ret5|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:09,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {765#(and (<= |fibo1_#t~ret5| 0) (<= 1 |fibo1_#t~ret4|) (<= 0 |fibo1_#t~ret5|) (<= |fibo1_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {708#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:09,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {708#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {708#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:09,012 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {708#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {675#true} #47#return; {695#(and (<= 1 |ULTIMATE.start_main_#t~ret8#1|) (<= |ULTIMATE.start_main_#t~ret8#1| 1))} is VALID [2022-02-20 18:15:09,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {695#(and (<= 1 |ULTIMATE.start_main_#t~ret8#1|) (<= |ULTIMATE.start_main_#t~ret8#1| 1))} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {696#(and (< 0 |ULTIMATE.start_main_~result~0#1|) (<= |ULTIMATE.start_main_~result~0#1| 1))} is VALID [2022-02-20 18:15:09,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {696#(and (< 0 |ULTIMATE.start_main_~result~0#1|) (<= |ULTIMATE.start_main_~result~0#1| 1))} assume 1 != main_~result~0#1; {676#false} is VALID [2022-02-20 18:15:09,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {676#false} assume !false; {676#false} is VALID [2022-02-20 18:15:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:15:09,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:15:09,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {676#false} assume !false; {676#false} is VALID [2022-02-20 18:15:09,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {696#(and (< 0 |ULTIMATE.start_main_~result~0#1|) (<= |ULTIMATE.start_main_~result~0#1| 1))} assume 1 != main_~result~0#1; {676#false} is VALID [2022-02-20 18:15:09,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {695#(and (<= 1 |ULTIMATE.start_main_#t~ret8#1|) (<= |ULTIMATE.start_main_#t~ret8#1| 1))} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {696#(and (< 0 |ULTIMATE.start_main_~result~0#1|) (<= |ULTIMATE.start_main_~result~0#1| 1))} is VALID [2022-02-20 18:15:09,344 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {708#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} {675#true} #47#return; {695#(and (<= 1 |ULTIMATE.start_main_#t~ret8#1|) (<= |ULTIMATE.start_main_#t~ret8#1| 1))} is VALID [2022-02-20 18:15:09,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {708#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} assume true; {708#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:09,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {707#(and (<= 1 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {708#(and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))} is VALID [2022-02-20 18:15:09,347 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} #55#return; {707#(and (<= 1 (+ |fibo1_#t~ret5| |fibo1_#t~ret4|)) (<= (+ |fibo1_#t~ret5| |fibo1_#t~ret4|) 1))} is VALID [2022-02-20 18:15:09,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} assume true; {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:09,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {675#true} assume ~n < 1;#res := 0; {710#(and (<= 0 |fibo2_#res|) (<= |fibo2_#res| 0))} is VALID [2022-02-20 18:15:09,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {675#true} ~n := #in~n; {675#true} is VALID [2022-02-20 18:15:09,351 INFO L272 TraceCheckUtils]: 13: Hoare triple {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} call #t~ret5 := fibo2(~n - 2); {675#true} is VALID [2022-02-20 18:15:09,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:09,352 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} {675#true} #53#return; {702#(and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))} is VALID [2022-02-20 18:15:09,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} assume true; {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:09,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {675#true} assume 1 == ~n;#res := 1; {709#(and (<= |fibo2_#res| 1) (<= 1 |fibo2_#res|))} is VALID [2022-02-20 18:15:09,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {675#true} assume !(~n < 1); {675#true} is VALID [2022-02-20 18:15:09,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {675#true} ~n := #in~n; {675#true} is VALID [2022-02-20 18:15:09,353 INFO L272 TraceCheckUtils]: 6: Hoare triple {675#true} call #t~ret4 := fibo2(~n - 1); {675#true} is VALID [2022-02-20 18:15:09,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {675#true} assume !(1 == ~n); {675#true} is VALID [2022-02-20 18:15:09,354 INFO L290 TraceCheckUtils]: 4: Hoare triple {675#true} assume !(~n < 1); {675#true} is VALID [2022-02-20 18:15:09,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {675#true} ~n := #in~n; {675#true} is VALID [2022-02-20 18:15:09,354 INFO L272 TraceCheckUtils]: 2: Hoare triple {675#true} call main_#t~ret8#1 := fibo1(main_~x~0#1); {675#true} is VALID [2022-02-20 18:15:09,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2; {675#true} is VALID [2022-02-20 18:15:09,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {675#true} is VALID [2022-02-20 18:15:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:15:09,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291215662] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:15:09,355 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:15:09,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2022-02-20 18:15:09,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391072247] [2022-02-20 18:15:09,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:15:09,358 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2022-02-20 18:15:09,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:09,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 18:15:09,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:09,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 18:15:09,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:09,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 18:15:09,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:15:09,381 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 18:15:09,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:09,546 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-02-20 18:15:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 18:15:09,546 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2022-02-20 18:15:09,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:09,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 18:15:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-02-20 18:15:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 18:15:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-02-20 18:15:09,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-02-20 18:15:09,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:09,586 INFO L225 Difference]: With dead ends: 43 [2022-02-20 18:15:09,586 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 18:15:09,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:15:09,587 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:09,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 259 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:15:09,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 18:15:09,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2022-02-20 18:15:09,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:09,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-02-20 18:15:09,602 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-02-20 18:15:09,602 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-02-20 18:15:09,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:09,605 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-02-20 18:15:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-02-20 18:15:09,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:09,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:09,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Second operand 39 states. [2022-02-20 18:15:09,608 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Second operand 39 states. [2022-02-20 18:15:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:09,617 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-02-20 18:15:09,617 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-02-20 18:15:09,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:09,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:09,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:09,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-02-20 18:15:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-02-20 18:15:09,620 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 24 [2022-02-20 18:15:09,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:09,621 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-02-20 18:15:09,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 18:15:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-02-20 18:15:09,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:15:09,622 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:09,622 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:09,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 18:15:09,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 18:15:09,836 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:09,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:09,836 INFO L85 PathProgramCache]: Analyzing trace with hash 988182601, now seen corresponding path program 1 times [2022-02-20 18:15:09,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:09,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272015949] [2022-02-20 18:15:09,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:09,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:09,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:09,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:09,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {1023#true} ~n := #in~n; {1056#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:09,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {1056#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1056#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:09,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {1056#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1057#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:09,899 INFO L290 TraceCheckUtils]: 3: Hoare triple {1057#(<= |fibo2_#in~n| 1)} assume true; {1057#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:09,912 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1057#(<= |fibo2_#in~n| 1)} {1023#true} #53#return; {1050#(<= fibo1_~n 2)} is VALID [2022-02-20 18:15:09,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 18:15:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:09,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {1023#true} ~n := #in~n; {1056#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:09,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {1056#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1058#(and (= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} is VALID [2022-02-20 18:15:09,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {1058#(and (= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} assume 1 == ~n;#res := 1; {1059#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:09,946 INFO L290 TraceCheckUtils]: 3: Hoare triple {1059#(<= 1 |fibo2_#in~n|)} assume true; {1059#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:09,947 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1059#(<= 1 |fibo2_#in~n|)} {1050#(<= fibo1_~n 2)} #55#return; {1024#false} is VALID [2022-02-20 18:15:09,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {1023#true} ~n := #in~n; {1023#true} is VALID [2022-02-20 18:15:09,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {1023#true} assume !(~n < 1); {1023#true} is VALID [2022-02-20 18:15:09,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {1023#true} assume !(1 == ~n); {1023#true} is VALID [2022-02-20 18:15:09,947 INFO L272 TraceCheckUtils]: 3: Hoare triple {1023#true} call #t~ret4 := fibo2(~n - 1); {1023#true} is VALID [2022-02-20 18:15:09,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {1023#true} ~n := #in~n; {1056#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:09,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {1056#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1056#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:09,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {1056#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1057#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:09,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {1057#(<= |fibo2_#in~n| 1)} assume true; {1057#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:09,950 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1057#(<= |fibo2_#in~n| 1)} {1023#true} #53#return; {1050#(<= fibo1_~n 2)} is VALID [2022-02-20 18:15:09,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {1050#(<= fibo1_~n 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1050#(<= fibo1_~n 2)} is VALID [2022-02-20 18:15:09,955 INFO L272 TraceCheckUtils]: 10: Hoare triple {1050#(<= fibo1_~n 2)} call #t~ret5 := fibo2(~n - 2); {1023#true} is VALID [2022-02-20 18:15:09,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {1023#true} ~n := #in~n; {1056#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:09,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {1056#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1058#(and (= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} is VALID [2022-02-20 18:15:09,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {1058#(and (= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} assume 1 == ~n;#res := 1; {1059#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:09,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {1059#(<= 1 |fibo2_#in~n|)} assume true; {1059#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:09,957 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1059#(<= 1 |fibo2_#in~n|)} {1050#(<= fibo1_~n 2)} #55#return; {1024#false} is VALID [2022-02-20 18:15:09,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {1024#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1024#false} is VALID [2022-02-20 18:15:09,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {1024#false} assume true; {1024#false} is VALID [2022-02-20 18:15:09,958 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1024#false} {1025#(= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {1024#false} is VALID [2022-02-20 18:15:09,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {1023#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1023#true} is VALID [2022-02-20 18:15:09,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {1023#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2; {1025#(= 2 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:09,958 INFO L272 TraceCheckUtils]: 2: Hoare triple {1025#(= 2 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1023#true} is VALID [2022-02-20 18:15:09,958 INFO L290 TraceCheckUtils]: 3: Hoare triple {1023#true} ~n := #in~n; {1023#true} is VALID [2022-02-20 18:15:09,958 INFO L290 TraceCheckUtils]: 4: Hoare triple {1023#true} assume !(~n < 1); {1023#true} is VALID [2022-02-20 18:15:09,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {1023#true} assume !(1 == ~n); {1023#true} is VALID [2022-02-20 18:15:09,958 INFO L272 TraceCheckUtils]: 6: Hoare triple {1023#true} call #t~ret4 := fibo2(~n - 1); {1023#true} is VALID [2022-02-20 18:15:09,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {1023#true} ~n := #in~n; {1056#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:09,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {1056#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1056#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:09,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {1056#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1057#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:09,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {1057#(<= |fibo2_#in~n| 1)} assume true; {1057#(<= |fibo2_#in~n| 1)} is VALID [2022-02-20 18:15:09,960 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1057#(<= |fibo2_#in~n| 1)} {1023#true} #53#return; {1050#(<= fibo1_~n 2)} is VALID [2022-02-20 18:15:09,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {1050#(<= fibo1_~n 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1050#(<= fibo1_~n 2)} is VALID [2022-02-20 18:15:09,961 INFO L272 TraceCheckUtils]: 13: Hoare triple {1050#(<= fibo1_~n 2)} call #t~ret5 := fibo2(~n - 2); {1023#true} is VALID [2022-02-20 18:15:09,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {1023#true} ~n := #in~n; {1056#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:09,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {1056#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1058#(and (= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} is VALID [2022-02-20 18:15:09,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {1058#(and (= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} assume 1 == ~n;#res := 1; {1059#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:09,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {1059#(<= 1 |fibo2_#in~n|)} assume true; {1059#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:09,963 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1059#(<= 1 |fibo2_#in~n|)} {1050#(<= fibo1_~n 2)} #55#return; {1024#false} is VALID [2022-02-20 18:15:09,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {1024#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1024#false} is VALID [2022-02-20 18:15:09,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {1024#false} assume true; {1024#false} is VALID [2022-02-20 18:15:09,963 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1024#false} {1025#(= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {1024#false} is VALID [2022-02-20 18:15:09,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {1024#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1024#false} is VALID [2022-02-20 18:15:09,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {1024#false} assume 1 != main_~result~0#1; {1024#false} is VALID [2022-02-20 18:15:09,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {1024#false} assume !false; {1024#false} is VALID [2022-02-20 18:15:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:15:09,963 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:09,963 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272015949] [2022-02-20 18:15:09,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272015949] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:15:09,964 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480358140] [2022-02-20 18:15:09,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:09,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:09,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:15:09,965 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) [2022-02-20 18:15:09,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 18:15:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:09,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 18:15:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:10,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:15:10,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {1023#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1023#true} is VALID [2022-02-20 18:15:10,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {1023#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2; {1066#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-20 18:15:10,127 INFO L272 TraceCheckUtils]: 2: Hoare triple {1066#(<= |ULTIMATE.start_main_~x~0#1| 2)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1023#true} is VALID [2022-02-20 18:15:10,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {1023#true} ~n := #in~n; {1073#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:10,129 INFO L290 TraceCheckUtils]: 4: Hoare triple {1073#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {1073#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:10,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {1073#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {1073#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:10,129 INFO L272 TraceCheckUtils]: 6: Hoare triple {1073#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {1023#true} is VALID [2022-02-20 18:15:10,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {1023#true} ~n := #in~n; {1023#true} is VALID [2022-02-20 18:15:10,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {1023#true} assume !(~n < 1); {1023#true} is VALID [2022-02-20 18:15:10,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {1023#true} assume 1 == ~n;#res := 1; {1023#true} is VALID [2022-02-20 18:15:10,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {1023#true} assume true; {1023#true} is VALID [2022-02-20 18:15:10,130 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1023#true} {1073#(<= fibo1_~n |fibo1_#in~n|)} #53#return; {1073#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:10,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {1073#(<= fibo1_~n |fibo1_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1073#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:10,130 INFO L272 TraceCheckUtils]: 13: Hoare triple {1073#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret5 := fibo2(~n - 2); {1023#true} is VALID [2022-02-20 18:15:10,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {1023#true} ~n := #in~n; {1107#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:10,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {1107#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1059#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:10,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {1059#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1059#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:10,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {1059#(<= 1 |fibo2_#in~n|)} assume true; {1059#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:10,132 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1059#(<= 1 |fibo2_#in~n|)} {1073#(<= fibo1_~n |fibo1_#in~n|)} #55#return; {1120#(<= 3 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:10,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {1120#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1120#(<= 3 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:10,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {1120#(<= 3 |fibo1_#in~n|)} assume true; {1120#(<= 3 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:10,133 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1120#(<= 3 |fibo1_#in~n|)} {1066#(<= |ULTIMATE.start_main_~x~0#1| 2)} #47#return; {1024#false} is VALID [2022-02-20 18:15:10,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {1024#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1024#false} is VALID [2022-02-20 18:15:10,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {1024#false} assume 1 != main_~result~0#1; {1024#false} is VALID [2022-02-20 18:15:10,133 INFO L290 TraceCheckUtils]: 24: Hoare triple {1024#false} assume !false; {1024#false} is VALID [2022-02-20 18:15:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:15:10,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:15:10,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480358140] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:15:10,134 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 18:15:10,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 12 [2022-02-20 18:15:10,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182283769] [2022-02-20 18:15:10,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:15:10,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-20 18:15:10,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:10,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:15:10,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:10,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:15:10,151 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:10,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:15:10,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:15:10,152 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:15:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:10,349 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-02-20 18:15:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:15:10,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-20 18:15:10,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:15:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-02-20 18:15:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:15:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-02-20 18:15:10,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2022-02-20 18:15:10,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:10,383 INFO L225 Difference]: With dead ends: 41 [2022-02-20 18:15:10,383 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 18:15:10,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:15:10,384 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:10,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 94 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:15:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 18:15:10,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2022-02-20 18:15:10,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:10,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-02-20 18:15:10,400 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-02-20 18:15:10,401 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-02-20 18:15:10,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:10,405 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-02-20 18:15:10,405 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-02-20 18:15:10,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:10,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:10,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Second operand 37 states. [2022-02-20 18:15:10,406 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Second operand 37 states. [2022-02-20 18:15:10,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:10,409 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-02-20 18:15:10,409 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-02-20 18:15:10,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:10,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:10,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:10,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-02-20 18:15:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-02-20 18:15:10,412 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 25 [2022-02-20 18:15:10,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:10,413 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-02-20 18:15:10,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:15:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-02-20 18:15:10,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 18:15:10,414 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:10,414 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:10,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 18:15:10,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:10,623 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:10,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:10,623 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2022-02-20 18:15:10,624 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:10,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778420200] [2022-02-20 18:15:10,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:10,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:10,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:10,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:10,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:10,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {1308#true} ~n := #in~n; {1372#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:10,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {1372#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1373#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:10,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {1373#(<= |fibo1_#in~n| 0)} assume true; {1373#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:10,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1373#(<= |fibo1_#in~n| 0)} {1363#(not (<= fibo2_~n 1))} #49#return; {1309#false} is VALID [2022-02-20 18:15:10,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 18:15:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:10,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {1308#true} ~n := #in~n; {1308#true} is VALID [2022-02-20 18:15:10,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {1308#true} assume ~n < 1;#res := 0; {1308#true} is VALID [2022-02-20 18:15:10,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-02-20 18:15:10,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1308#true} {1309#false} #51#return; {1309#false} is VALID [2022-02-20 18:15:10,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {1308#true} ~n := #in~n; {1308#true} is VALID [2022-02-20 18:15:10,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {1308#true} assume !(~n < 1); {1362#(< 0 fibo2_~n)} is VALID [2022-02-20 18:15:10,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {1362#(< 0 fibo2_~n)} assume !(1 == ~n); {1363#(not (<= fibo2_~n 1))} is VALID [2022-02-20 18:15:10,729 INFO L272 TraceCheckUtils]: 3: Hoare triple {1363#(not (<= fibo2_~n 1))} call #t~ret6 := fibo1(~n - 1); {1308#true} is VALID [2022-02-20 18:15:10,730 INFO L290 TraceCheckUtils]: 4: Hoare triple {1308#true} ~n := #in~n; {1372#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:10,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {1372#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1373#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:10,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {1373#(<= |fibo1_#in~n| 0)} assume true; {1373#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:10,731 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1373#(<= |fibo1_#in~n| 0)} {1363#(not (<= fibo2_~n 1))} #49#return; {1309#false} is VALID [2022-02-20 18:15:10,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {1309#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {1309#false} is VALID [2022-02-20 18:15:10,731 INFO L272 TraceCheckUtils]: 9: Hoare triple {1309#false} call #t~ret7 := fibo1(~n - 2); {1308#true} is VALID [2022-02-20 18:15:10,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {1308#true} ~n := #in~n; {1308#true} is VALID [2022-02-20 18:15:10,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {1308#true} assume ~n < 1;#res := 0; {1308#true} is VALID [2022-02-20 18:15:10,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-02-20 18:15:10,732 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1308#true} {1309#false} #51#return; {1309#false} is VALID [2022-02-20 18:15:10,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {1309#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {1309#false} is VALID [2022-02-20 18:15:10,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {1309#false} assume true; {1309#false} is VALID [2022-02-20 18:15:10,732 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1309#false} {1308#true} #53#return; {1309#false} is VALID [2022-02-20 18:15:10,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 18:15:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:10,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {1308#true} ~n := #in~n; {1308#true} is VALID [2022-02-20 18:15:10,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {1308#true} assume ~n < 1;#res := 0; {1308#true} is VALID [2022-02-20 18:15:10,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-02-20 18:15:10,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1308#true} {1309#false} #55#return; {1309#false} is VALID [2022-02-20 18:15:10,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {1308#true} ~n := #in~n; {1308#true} is VALID [2022-02-20 18:15:10,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {1308#true} assume !(~n < 1); {1308#true} is VALID [2022-02-20 18:15:10,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {1308#true} assume !(1 == ~n); {1308#true} is VALID [2022-02-20 18:15:10,737 INFO L272 TraceCheckUtils]: 3: Hoare triple {1308#true} call #t~ret4 := fibo2(~n - 1); {1308#true} is VALID [2022-02-20 18:15:10,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {1308#true} ~n := #in~n; {1308#true} is VALID [2022-02-20 18:15:10,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {1308#true} assume !(~n < 1); {1362#(< 0 fibo2_~n)} is VALID [2022-02-20 18:15:10,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {1362#(< 0 fibo2_~n)} assume !(1 == ~n); {1363#(not (<= fibo2_~n 1))} is VALID [2022-02-20 18:15:10,738 INFO L272 TraceCheckUtils]: 7: Hoare triple {1363#(not (<= fibo2_~n 1))} call #t~ret6 := fibo1(~n - 1); {1308#true} is VALID [2022-02-20 18:15:10,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {1308#true} ~n := #in~n; {1372#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:10,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {1372#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1373#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:10,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {1373#(<= |fibo1_#in~n| 0)} assume true; {1373#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:10,740 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1373#(<= |fibo1_#in~n| 0)} {1363#(not (<= fibo2_~n 1))} #49#return; {1309#false} is VALID [2022-02-20 18:15:10,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {1309#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {1309#false} is VALID [2022-02-20 18:15:10,741 INFO L272 TraceCheckUtils]: 13: Hoare triple {1309#false} call #t~ret7 := fibo1(~n - 2); {1308#true} is VALID [2022-02-20 18:15:10,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {1308#true} ~n := #in~n; {1308#true} is VALID [2022-02-20 18:15:10,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {1308#true} assume ~n < 1;#res := 0; {1308#true} is VALID [2022-02-20 18:15:10,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-02-20 18:15:10,741 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1308#true} {1309#false} #51#return; {1309#false} is VALID [2022-02-20 18:15:10,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {1309#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {1309#false} is VALID [2022-02-20 18:15:10,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {1309#false} assume true; {1309#false} is VALID [2022-02-20 18:15:10,742 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1309#false} {1308#true} #53#return; {1309#false} is VALID [2022-02-20 18:15:10,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {1309#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1309#false} is VALID [2022-02-20 18:15:10,742 INFO L272 TraceCheckUtils]: 22: Hoare triple {1309#false} call #t~ret5 := fibo2(~n - 2); {1308#true} is VALID [2022-02-20 18:15:10,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {1308#true} ~n := #in~n; {1308#true} is VALID [2022-02-20 18:15:10,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {1308#true} assume ~n < 1;#res := 0; {1308#true} is VALID [2022-02-20 18:15:10,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-02-20 18:15:10,742 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1308#true} {1309#false} #55#return; {1309#false} is VALID [2022-02-20 18:15:10,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {1309#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1309#false} is VALID [2022-02-20 18:15:10,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {1309#false} assume true; {1309#false} is VALID [2022-02-20 18:15:10,743 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1309#false} {1310#(= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {1309#false} is VALID [2022-02-20 18:15:10,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {1308#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1308#true} is VALID [2022-02-20 18:15:10,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {1308#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2; {1310#(= 2 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:10,743 INFO L272 TraceCheckUtils]: 2: Hoare triple {1310#(= 2 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1308#true} is VALID [2022-02-20 18:15:10,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {1308#true} ~n := #in~n; {1308#true} is VALID [2022-02-20 18:15:10,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {1308#true} assume !(~n < 1); {1308#true} is VALID [2022-02-20 18:15:10,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {1308#true} assume !(1 == ~n); {1308#true} is VALID [2022-02-20 18:15:10,744 INFO L272 TraceCheckUtils]: 6: Hoare triple {1308#true} call #t~ret4 := fibo2(~n - 1); {1308#true} is VALID [2022-02-20 18:15:10,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {1308#true} ~n := #in~n; {1308#true} is VALID [2022-02-20 18:15:10,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {1308#true} assume !(~n < 1); {1362#(< 0 fibo2_~n)} is VALID [2022-02-20 18:15:10,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {1362#(< 0 fibo2_~n)} assume !(1 == ~n); {1363#(not (<= fibo2_~n 1))} is VALID [2022-02-20 18:15:10,745 INFO L272 TraceCheckUtils]: 10: Hoare triple {1363#(not (<= fibo2_~n 1))} call #t~ret6 := fibo1(~n - 1); {1308#true} is VALID [2022-02-20 18:15:10,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {1308#true} ~n := #in~n; {1372#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:10,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {1372#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1373#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:10,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {1373#(<= |fibo1_#in~n| 0)} assume true; {1373#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:10,750 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1373#(<= |fibo1_#in~n| 0)} {1363#(not (<= fibo2_~n 1))} #49#return; {1309#false} is VALID [2022-02-20 18:15:10,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {1309#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {1309#false} is VALID [2022-02-20 18:15:10,750 INFO L272 TraceCheckUtils]: 16: Hoare triple {1309#false} call #t~ret7 := fibo1(~n - 2); {1308#true} is VALID [2022-02-20 18:15:10,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {1308#true} ~n := #in~n; {1308#true} is VALID [2022-02-20 18:15:10,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {1308#true} assume ~n < 1;#res := 0; {1308#true} is VALID [2022-02-20 18:15:10,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-02-20 18:15:10,751 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1308#true} {1309#false} #51#return; {1309#false} is VALID [2022-02-20 18:15:10,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {1309#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {1309#false} is VALID [2022-02-20 18:15:10,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {1309#false} assume true; {1309#false} is VALID [2022-02-20 18:15:10,751 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1309#false} {1308#true} #53#return; {1309#false} is VALID [2022-02-20 18:15:10,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {1309#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1309#false} is VALID [2022-02-20 18:15:10,752 INFO L272 TraceCheckUtils]: 25: Hoare triple {1309#false} call #t~ret5 := fibo2(~n - 2); {1308#true} is VALID [2022-02-20 18:15:10,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {1308#true} ~n := #in~n; {1308#true} is VALID [2022-02-20 18:15:10,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {1308#true} assume ~n < 1;#res := 0; {1308#true} is VALID [2022-02-20 18:15:10,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-02-20 18:15:10,752 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1308#true} {1309#false} #55#return; {1309#false} is VALID [2022-02-20 18:15:10,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {1309#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1309#false} is VALID [2022-02-20 18:15:10,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {1309#false} assume true; {1309#false} is VALID [2022-02-20 18:15:10,752 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1309#false} {1310#(= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {1309#false} is VALID [2022-02-20 18:15:10,752 INFO L290 TraceCheckUtils]: 33: Hoare triple {1309#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1309#false} is VALID [2022-02-20 18:15:10,753 INFO L290 TraceCheckUtils]: 34: Hoare triple {1309#false} assume 1 != main_~result~0#1; {1309#false} is VALID [2022-02-20 18:15:10,753 INFO L290 TraceCheckUtils]: 35: Hoare triple {1309#false} assume !false; {1309#false} is VALID [2022-02-20 18:15:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 18:15:10,753 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:10,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778420200] [2022-02-20 18:15:10,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778420200] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:15:10,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342810197] [2022-02-20 18:15:10,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:10,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:10,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:15:10,755 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) [2022-02-20 18:15:10,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 18:15:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:10,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 18:15:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:10,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:15:11,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {1308#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1308#true} is VALID [2022-02-20 18:15:11,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {1308#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2; {1380#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-20 18:15:11,043 INFO L272 TraceCheckUtils]: 2: Hoare triple {1380#(<= |ULTIMATE.start_main_~x~0#1| 2)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1308#true} is VALID [2022-02-20 18:15:11,044 INFO L290 TraceCheckUtils]: 3: Hoare triple {1308#true} ~n := #in~n; {1387#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:11,044 INFO L290 TraceCheckUtils]: 4: Hoare triple {1387#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {1387#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:11,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {1387#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {1387#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:11,044 INFO L272 TraceCheckUtils]: 6: Hoare triple {1387#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {1308#true} is VALID [2022-02-20 18:15:11,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {1308#true} ~n := #in~n; {1400#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:11,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {1400#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1404#(and (not (< fibo2_~n 1)) (<= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-20 18:15:11,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {1404#(and (not (< fibo2_~n 1)) (<= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {1408#(< 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:11,045 INFO L272 TraceCheckUtils]: 10: Hoare triple {1408#(< 1 |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {1308#true} is VALID [2022-02-20 18:15:11,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {1308#true} ~n := #in~n; {1308#true} is VALID [2022-02-20 18:15:11,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {1308#true} assume ~n < 1;#res := 0; {1308#true} is VALID [2022-02-20 18:15:11,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-02-20 18:15:11,046 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1308#true} {1408#(< 1 |fibo2_#in~n|)} #49#return; {1408#(< 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:11,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {1408#(< 1 |fibo2_#in~n|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {1408#(< 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:11,046 INFO L272 TraceCheckUtils]: 16: Hoare triple {1408#(< 1 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {1308#true} is VALID [2022-02-20 18:15:11,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {1308#true} ~n := #in~n; {1308#true} is VALID [2022-02-20 18:15:11,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {1308#true} assume ~n < 1;#res := 0; {1308#true} is VALID [2022-02-20 18:15:11,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-02-20 18:15:11,047 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1308#true} {1408#(< 1 |fibo2_#in~n|)} #51#return; {1408#(< 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:11,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {1408#(< 1 |fibo2_#in~n|)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {1408#(< 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:11,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {1408#(< 1 |fibo2_#in~n|)} assume true; {1408#(< 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:11,048 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1408#(< 1 |fibo2_#in~n|)} {1387#(<= fibo1_~n |fibo1_#in~n|)} #53#return; {1451#(< 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:11,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {1451#(< 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1451#(< 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:11,048 INFO L272 TraceCheckUtils]: 25: Hoare triple {1451#(< 2 |fibo1_#in~n|)} call #t~ret5 := fibo2(~n - 2); {1308#true} is VALID [2022-02-20 18:15:11,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {1308#true} ~n := #in~n; {1308#true} is VALID [2022-02-20 18:15:11,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {1308#true} assume ~n < 1;#res := 0; {1308#true} is VALID [2022-02-20 18:15:11,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-02-20 18:15:11,049 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1308#true} {1451#(< 2 |fibo1_#in~n|)} #55#return; {1451#(< 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:11,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {1451#(< 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1451#(< 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:11,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {1451#(< 2 |fibo1_#in~n|)} assume true; {1451#(< 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:11,050 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1451#(< 2 |fibo1_#in~n|)} {1380#(<= |ULTIMATE.start_main_~x~0#1| 2)} #47#return; {1309#false} is VALID [2022-02-20 18:15:11,050 INFO L290 TraceCheckUtils]: 33: Hoare triple {1309#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1309#false} is VALID [2022-02-20 18:15:11,050 INFO L290 TraceCheckUtils]: 34: Hoare triple {1309#false} assume 1 != main_~result~0#1; {1309#false} is VALID [2022-02-20 18:15:11,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {1309#false} assume !false; {1309#false} is VALID [2022-02-20 18:15:11,051 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 18:15:11,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:15:12,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {1309#false} assume !false; {1309#false} is VALID [2022-02-20 18:15:12,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {1309#false} assume 1 != main_~result~0#1; {1309#false} is VALID [2022-02-20 18:15:12,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {1309#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1309#false} is VALID [2022-02-20 18:15:12,089 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1451#(< 2 |fibo1_#in~n|)} {1380#(<= |ULTIMATE.start_main_~x~0#1| 2)} #47#return; {1309#false} is VALID [2022-02-20 18:15:12,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {1451#(< 2 |fibo1_#in~n|)} assume true; {1451#(< 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:12,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {1451#(< 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1451#(< 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:12,090 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1308#true} {1451#(< 2 |fibo1_#in~n|)} #55#return; {1451#(< 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:12,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-02-20 18:15:12,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {1308#true} assume ~n < 1;#res := 0; {1308#true} is VALID [2022-02-20 18:15:12,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {1308#true} ~n := #in~n; {1308#true} is VALID [2022-02-20 18:15:12,091 INFO L272 TraceCheckUtils]: 25: Hoare triple {1451#(< 2 |fibo1_#in~n|)} call #t~ret5 := fibo2(~n - 2); {1308#true} is VALID [2022-02-20 18:15:12,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {1451#(< 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1451#(< 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:12,093 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1408#(< 1 |fibo2_#in~n|)} {1527#(or (<= fibo1_~n 2) (< 2 |fibo1_#in~n|))} #53#return; {1451#(< 2 |fibo1_#in~n|)} is VALID [2022-02-20 18:15:12,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {1408#(< 1 |fibo2_#in~n|)} assume true; {1408#(< 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:12,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {1408#(< 1 |fibo2_#in~n|)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {1408#(< 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:12,094 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1308#true} {1408#(< 1 |fibo2_#in~n|)} #51#return; {1408#(< 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:12,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-02-20 18:15:12,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {1308#true} assume ~n < 1;#res := 0; {1308#true} is VALID [2022-02-20 18:15:12,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {1308#true} ~n := #in~n; {1308#true} is VALID [2022-02-20 18:15:12,094 INFO L272 TraceCheckUtils]: 16: Hoare triple {1408#(< 1 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {1308#true} is VALID [2022-02-20 18:15:12,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {1408#(< 1 |fibo2_#in~n|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {1408#(< 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:12,095 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1308#true} {1408#(< 1 |fibo2_#in~n|)} #49#return; {1408#(< 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:12,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-02-20 18:15:12,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {1308#true} assume ~n < 1;#res := 0; {1308#true} is VALID [2022-02-20 18:15:12,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {1308#true} ~n := #in~n; {1308#true} is VALID [2022-02-20 18:15:12,095 INFO L272 TraceCheckUtils]: 10: Hoare triple {1408#(< 1 |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {1308#true} is VALID [2022-02-20 18:15:12,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {1573#(or (= fibo2_~n 1) (< 1 |fibo2_#in~n|))} assume !(1 == ~n); {1408#(< 1 |fibo2_#in~n|)} is VALID [2022-02-20 18:15:12,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {1577#(or (= fibo2_~n 1) (< 1 |fibo2_#in~n|) (< fibo2_~n 1))} assume !(~n < 1); {1573#(or (= fibo2_~n 1) (< 1 |fibo2_#in~n|))} is VALID [2022-02-20 18:15:12,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {1308#true} ~n := #in~n; {1577#(or (= fibo2_~n 1) (< 1 |fibo2_#in~n|) (< fibo2_~n 1))} is VALID [2022-02-20 18:15:12,097 INFO L272 TraceCheckUtils]: 6: Hoare triple {1527#(or (<= fibo1_~n 2) (< 2 |fibo1_#in~n|))} call #t~ret4 := fibo2(~n - 1); {1308#true} is VALID [2022-02-20 18:15:12,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {1527#(or (<= fibo1_~n 2) (< 2 |fibo1_#in~n|))} assume !(1 == ~n); {1527#(or (<= fibo1_~n 2) (< 2 |fibo1_#in~n|))} is VALID [2022-02-20 18:15:12,097 INFO L290 TraceCheckUtils]: 4: Hoare triple {1527#(or (<= fibo1_~n 2) (< 2 |fibo1_#in~n|))} assume !(~n < 1); {1527#(or (<= fibo1_~n 2) (< 2 |fibo1_#in~n|))} is VALID [2022-02-20 18:15:12,098 INFO L290 TraceCheckUtils]: 3: Hoare triple {1308#true} ~n := #in~n; {1527#(or (<= fibo1_~n 2) (< 2 |fibo1_#in~n|))} is VALID [2022-02-20 18:15:12,098 INFO L272 TraceCheckUtils]: 2: Hoare triple {1380#(<= |ULTIMATE.start_main_~x~0#1| 2)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1308#true} is VALID [2022-02-20 18:15:12,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {1308#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2; {1380#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-20 18:15:12,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {1308#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1308#true} is VALID [2022-02-20 18:15:12,098 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 18:15:12,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342810197] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:15:12,099 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:15:12,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2022-02-20 18:15:12,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153701766] [2022-02-20 18:15:12,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:15:12,100 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 3 states have call predecessors, (11), 9 states have call successors, (11) Word has length 36 [2022-02-20 18:15:12,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:12,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 3 states have call predecessors, (11), 9 states have call successors, (11) [2022-02-20 18:15:12,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:12,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 18:15:12,137 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:12,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 18:15:12,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-02-20 18:15:12,138 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 16 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 3 states have call predecessors, (11), 9 states have call successors, (11) [2022-02-20 18:15:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:12,540 INFO L93 Difference]: Finished difference Result 66 states and 98 transitions. [2022-02-20 18:15:12,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 18:15:12,541 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 3 states have call predecessors, (11), 9 states have call successors, (11) Word has length 36 [2022-02-20 18:15:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 3 states have call predecessors, (11), 9 states have call successors, (11) [2022-02-20 18:15:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2022-02-20 18:15:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 3 states have call predecessors, (11), 9 states have call successors, (11) [2022-02-20 18:15:12,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2022-02-20 18:15:12,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 78 transitions. [2022-02-20 18:15:12,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:12,592 INFO L225 Difference]: With dead ends: 66 [2022-02-20 18:15:12,592 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 18:15:12,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:15:12,596 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:12,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 147 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:15:12,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 18:15:12,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 18:15:12,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:12,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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) [2022-02-20 18:15:12,597 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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) [2022-02-20 18:15:12,597 INFO L87 Difference]: Start difference. First operand 0 states. Second 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) [2022-02-20 18:15:12,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:12,598 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 18:15:12,598 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:15:12,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:12,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:12,598 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-02-20 18:15:12,598 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-02-20 18:15:12,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:12,599 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 18:15:12,599 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:15:12,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:12,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:12,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:12,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:12,599 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) [2022-02-20 18:15:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 18:15:12,599 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2022-02-20 18:15:12,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:12,600 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 18:15:12,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 3 states have call predecessors, (11), 9 states have call successors, (11) [2022-02-20 18:15:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:15:12,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:12,603 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:15:12,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 18:15:12,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:12,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 18:15:12,898 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 18:15:12,898 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 18:15:12,898 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 18:15:12,898 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 18:15:12,899 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 41) no Hoare annotation was computed. [2022-02-20 18:15:12,899 INFO L854 garLoopResultBuilder]: At program point L43(lines 37 44) the Hoare annotation is: (= 2 |ULTIMATE.start_main_~x~0#1|) [2022-02-20 18:15:12,899 INFO L858 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-02-20 18:15:12,899 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2022-02-20 18:15:12,899 INFO L854 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (= 2 |ULTIMATE.start_main_~x~0#1|) [2022-02-20 18:15:12,899 INFO L858 garLoopResultBuilder]: For program point L39-1(line 39) no Hoare annotation was computed. [2022-02-20 18:15:12,899 INFO L858 garLoopResultBuilder]: For program point L40-2(lines 40 42) no Hoare annotation was computed. [2022-02-20 18:15:12,900 INFO L861 garLoopResultBuilder]: At program point fibo2ENTRY(lines 19 27) the Hoare annotation is: true [2022-02-20 18:15:12,900 INFO L854 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2022-02-20 18:15:12,900 INFO L858 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-02-20 18:15:12,900 INFO L854 garLoopResultBuilder]: At program point L25-2(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2022-02-20 18:15:12,900 INFO L858 garLoopResultBuilder]: For program point L22(lines 22 26) no Hoare annotation was computed. [2022-02-20 18:15:12,900 INFO L858 garLoopResultBuilder]: For program point L25-3(line 25) no Hoare annotation was computed. [2022-02-20 18:15:12,900 INFO L858 garLoopResultBuilder]: For program point L20(lines 20 26) no Hoare annotation was computed. [2022-02-20 18:15:12,900 INFO L858 garLoopResultBuilder]: For program point fibo2FINAL(lines 19 27) no Hoare annotation was computed. [2022-02-20 18:15:12,900 INFO L858 garLoopResultBuilder]: For program point fibo2EXIT(lines 19 27) no Hoare annotation was computed. [2022-02-20 18:15:12,901 INFO L861 garLoopResultBuilder]: At program point fibo1ENTRY(lines 9 17) the Hoare annotation is: true [2022-02-20 18:15:12,901 INFO L854 garLoopResultBuilder]: At program point L15(line 15) the Hoare annotation is: (and (< 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2022-02-20 18:15:12,901 INFO L858 garLoopResultBuilder]: For program point L15-1(line 15) no Hoare annotation was computed. [2022-02-20 18:15:12,901 INFO L854 garLoopResultBuilder]: At program point L15-2(line 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (< 2 |fibo1_#in~n|)) (and (< 1 fibo1_~n) (<= 1 |fibo1_#t~ret4|) .cse0 (<= |fibo1_#t~ret4| 1)))) [2022-02-20 18:15:12,901 INFO L858 garLoopResultBuilder]: For program point L12(lines 12 16) no Hoare annotation was computed. [2022-02-20 18:15:12,901 INFO L858 garLoopResultBuilder]: For program point L15-3(line 15) no Hoare annotation was computed. [2022-02-20 18:15:12,901 INFO L858 garLoopResultBuilder]: For program point fibo1FINAL(lines 9 17) no Hoare annotation was computed. [2022-02-20 18:15:12,901 INFO L858 garLoopResultBuilder]: For program point L10(lines 10 16) no Hoare annotation was computed. [2022-02-20 18:15:12,902 INFO L858 garLoopResultBuilder]: For program point fibo1EXIT(lines 9 17) no Hoare annotation was computed. [2022-02-20 18:15:12,904 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 18:15:12,905 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:15:12,908 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 18:15:12,908 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 18:15:12,908 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 18:15:12,909 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 18:15:12,909 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 18:15:12,909 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 18:15:12,909 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 18:15:12,909 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 18:15:12,909 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-02-20 18:15:12,909 WARN L170 areAnnotationChecker]: fibo2FINAL has no Hoare annotation [2022-02-20 18:15:12,909 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 18:15:12,910 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 18:15:12,910 WARN L170 areAnnotationChecker]: fibo1FINAL has no Hoare annotation [2022-02-20 18:15:12,910 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 18:15:12,910 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 18:15:12,910 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-02-20 18:15:12,910 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2022-02-20 18:15:12,910 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2022-02-20 18:15:12,910 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-02-20 18:15:12,910 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2022-02-20 18:15:12,911 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2022-02-20 18:15:12,911 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2022-02-20 18:15:12,911 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2022-02-20 18:15:12,911 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 18:15:12,911 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 18:15:12,911 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2022-02-20 18:15:12,911 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2022-02-20 18:15:12,911 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-02-20 18:15:12,911 WARN L170 areAnnotationChecker]: L25-3 has no Hoare annotation [2022-02-20 18:15:12,911 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 18:15:12,912 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 18:15:12,912 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 18:15:12,912 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2022-02-20 18:15:12,912 WARN L170 areAnnotationChecker]: L25-3 has no Hoare annotation [2022-02-20 18:15:12,912 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 18:15:12,912 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 18:15:12,912 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 18:15:12,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 06:15:12 BoogieIcfgContainer [2022-02-20 18:15:12,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 18:15:12,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 18:15:12,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 18:15:12,920 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 18:15:12,920 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:15:05" (3/4) ... [2022-02-20 18:15:12,922 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 18:15:12,926 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2022-02-20 18:15:12,926 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2022-02-20 18:15:12,929 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-02-20 18:15:12,929 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 18:15:12,929 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 18:15:12,929 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 18:15:12,963 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 18:15:12,964 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 18:15:12,965 INFO L158 Benchmark]: Toolchain (without parser) took 7811.15ms. Allocated memory was 94.4MB in the beginning and 167.8MB in the end (delta: 73.4MB). Free memory was 61.0MB in the beginning and 121.6MB in the end (delta: -60.7MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2022-02-20 18:15:12,965 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory was 64.3MB in the beginning and 64.3MB in the end (delta: 21.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:15:12,965 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.33ms. Allocated memory is still 94.4MB. Free memory was 61.0MB in the beginning and 71.0MB in the end (delta: -10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 18:15:12,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.38ms. Allocated memory is still 94.4MB. Free memory was 71.0MB in the beginning and 69.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:15:12,966 INFO L158 Benchmark]: Boogie Preprocessor took 33.29ms. Allocated memory is still 94.4MB. Free memory was 69.5MB in the beginning and 68.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:15:12,966 INFO L158 Benchmark]: RCFGBuilder took 228.02ms. Allocated memory is still 94.4MB. Free memory was 68.4MB in the beginning and 58.4MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 18:15:12,966 INFO L158 Benchmark]: TraceAbstraction took 7224.48ms. Allocated memory was 94.4MB in the beginning and 167.8MB in the end (delta: 73.4MB). Free memory was 57.9MB in the beginning and 124.8MB in the end (delta: -66.8MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2022-02-20 18:15:12,967 INFO L158 Benchmark]: Witness Printer took 44.28ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 121.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:15:12,969 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory was 64.3MB in the beginning and 64.3MB in the end (delta: 21.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.33ms. Allocated memory is still 94.4MB. Free memory was 61.0MB in the beginning and 71.0MB in the end (delta: -10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.38ms. Allocated memory is still 94.4MB. Free memory was 71.0MB in the beginning and 69.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.29ms. Allocated memory is still 94.4MB. Free memory was 69.5MB in the beginning and 68.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 228.02ms. Allocated memory is still 94.4MB. Free memory was 68.4MB in the beginning and 58.4MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7224.48ms. Allocated memory was 94.4MB in the beginning and 167.8MB in the end (delta: 73.4MB). Free memory was 57.9MB in the beginning and 124.8MB in the end (delta: -66.8MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Witness Printer took 44.28ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 121.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 41]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 801 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 652 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 484 IncrementalHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 149 mSDtfsCounter, 484 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 273 GetRequests, 204 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=4, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 47 PreInvPairs, 57 NumberOfFragments, 50 HoareAnnotationTreeSize, 47 FomulaSimplifications, 91 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 307 ConstructedInterpolants, 0 QuantifiedInterpolants, 776 SizeOfPredicates, 7 NumberOfNonLiveVariables, 331 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 50/82 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 1 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: 2 == x RESULT: Ultimate proved your program to be correct! [2022-02-20 18:15:13,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE