/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci04.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:14:03,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:14:03,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:14:03,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:14:03,254 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:14:03,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:14:03,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:14:03,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:14:03,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:14:03,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:14:03,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:14:03,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:14:03,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:14:03,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:14:03,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:14:03,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:14:03,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:14:03,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:14:03,269 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:14:03,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:14:03,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:14:03,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:14:03,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:14:03,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:14:03,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:14:03,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:14:03,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:14:03,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:14:03,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:14:03,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:14:03,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:14:03,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:14:03,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:14:03,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:14:03,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:14:03,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:14:03,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:14:03,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:14:03,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:14:03,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:14:03,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:14:03,288 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:14:03,297 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:14:03,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:14:03,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:14:03,298 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:14:03,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:14:03,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:14:03,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:14:03,299 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:14:03,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:14:03,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:14:03,300 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:14:03,300 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:14:03,300 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:14:03,300 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:14:03,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:14:03,301 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:14:03,301 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:14:03,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:14:03,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:14:03,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:14:03,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:14:03,302 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:14:03,302 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:14:03,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:14:03,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:14:03,563 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:14:03,565 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:14:03,565 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:14:03,566 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci04.c [2020-07-18 00:14:03,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2181ca0af/597741f18f9d4793a0066fd15bc862e1/FLAGb96f243e8 [2020-07-18 00:14:04,075 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:14:04,076 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci04.c [2020-07-18 00:14:04,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2181ca0af/597741f18f9d4793a0066fd15bc862e1/FLAGb96f243e8 [2020-07-18 00:14:04,452 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2181ca0af/597741f18f9d4793a0066fd15bc862e1 [2020-07-18 00:14:04,462 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:14:04,465 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:14:04,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:04,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:14:04,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:14:04,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:14:04" (1/1) ... [2020-07-18 00:14:04,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eb07072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:04, skipping insertion in model container [2020-07-18 00:14:04,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:14:04" (1/1) ... [2020-07-18 00:14:04,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:14:04,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:14:04,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:04,668 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:14:04,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:04,701 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:14:04,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:04 WrapperNode [2020-07-18 00:14:04,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:04,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:14:04,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:14:04,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:14:04,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:04" (1/1) ... [2020-07-18 00:14:04,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:04" (1/1) ... [2020-07-18 00:14:04,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:04" (1/1) ... [2020-07-18 00:14:04,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:04" (1/1) ... [2020-07-18 00:14:04,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:04" (1/1) ... [2020-07-18 00:14:04,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:04" (1/1) ... [2020-07-18 00:14:04,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:04" (1/1) ... [2020-07-18 00:14:04,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:14:04,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:14:04,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:14:04,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:14:04,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:14:04,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:14:04,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:14:04,870 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-18 00:14:04,871 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:14:04,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:14:04,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:14:04,871 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-18 00:14:04,871 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:14:04,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:14:04,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:14:05,115 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:14:05,116 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 00:14:05,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:14:05 BoogieIcfgContainer [2020-07-18 00:14:05,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:14:05,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:14:05,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:14:05,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:14:05,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:14:04" (1/3) ... [2020-07-18 00:14:05,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f82962f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:14:05, skipping insertion in model container [2020-07-18 00:14:05,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:04" (2/3) ... [2020-07-18 00:14:05,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f82962f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:14:05, skipping insertion in model container [2020-07-18 00:14:05,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:14:05" (3/3) ... [2020-07-18 00:14:05,130 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2020-07-18 00:14:05,140 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:14:05,155 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:14:05,184 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:14:05,215 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:14:05,216 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:14:05,216 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:14:05,216 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:14:05,216 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:14:05,216 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:14:05,216 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:14:05,217 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:14:05,231 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-18 00:14:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-18 00:14:05,241 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:05,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:14:05,243 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:05,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:05,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2064988448, now seen corresponding path program 1 times [2020-07-18 00:14:05,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:05,258 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1632039666] [2020-07-18 00:14:05,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:05,458 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-18 00:14:05,459 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {36#true} {36#true} #44#return; {36#true} is VALID [2020-07-18 00:14:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:05,516 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} ~n := #in~n; {46#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 00:14:05,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:05,519 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#(<= |fibonacci_#in~n| 0)} #res := 0; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:05,520 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#(<= |fibonacci_#in~n| 0)} assume true; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:05,522 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {47#(<= |fibonacci_#in~n| 0)} {36#true} #48#return; {45#(<= main_~x~0 0)} is VALID [2020-07-18 00:14:05,523 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2020-07-18 00:14:05,523 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-18 00:14:05,524 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #44#return; {36#true} is VALID [2020-07-18 00:14:05,524 INFO L263 TraceCheckUtils]: 3: Hoare triple {36#true} call #t~ret4 := main(); {36#true} is VALID [2020-07-18 00:14:05,525 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {36#true} is VALID [2020-07-18 00:14:05,525 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#true} ~x~0 := #t~nondet2; {36#true} is VALID [2020-07-18 00:14:05,526 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#true} havoc #t~nondet2; {36#true} is VALID [2020-07-18 00:14:05,526 INFO L263 TraceCheckUtils]: 7: Hoare triple {36#true} call #t~ret3 := fibonacci(~x~0); {36#true} is VALID [2020-07-18 00:14:05,527 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#true} ~n := #in~n; {46#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 00:14:05,528 INFO L280 TraceCheckUtils]: 9: Hoare triple {46#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:05,529 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#(<= |fibonacci_#in~n| 0)} #res := 0; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:05,530 INFO L280 TraceCheckUtils]: 11: Hoare triple {47#(<= |fibonacci_#in~n| 0)} assume true; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:05,532 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {47#(<= |fibonacci_#in~n| 0)} {36#true} #48#return; {45#(<= main_~x~0 0)} is VALID [2020-07-18 00:14:05,533 INFO L280 TraceCheckUtils]: 13: Hoare triple {45#(<= main_~x~0 0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {45#(<= main_~x~0 0)} is VALID [2020-07-18 00:14:05,534 INFO L280 TraceCheckUtils]: 14: Hoare triple {45#(<= main_~x~0 0)} ~result~0 := #t~ret3; {45#(<= main_~x~0 0)} is VALID [2020-07-18 00:14:05,535 INFO L280 TraceCheckUtils]: 15: Hoare triple {45#(<= main_~x~0 0)} havoc #t~ret3; {45#(<= main_~x~0 0)} is VALID [2020-07-18 00:14:05,536 INFO L280 TraceCheckUtils]: 16: Hoare triple {45#(<= main_~x~0 0)} assume !(5 != ~x~0 || 3 == ~result~0); {37#false} is VALID [2020-07-18 00:14:05,537 INFO L280 TraceCheckUtils]: 17: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-18 00:14:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:14:05,546 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:05,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1632039666] [2020-07-18 00:14:05,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:05,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:14:05,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096894212] [2020-07-18 00:14:05,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-18 00:14:05,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:05,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:14:05,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:05,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:14:05,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:05,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:14:05,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:14:05,610 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-18 00:14:05,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:05,921 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-18 00:14:05,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:14:05,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-18 00:14:05,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:14:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2020-07-18 00:14:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:14:05,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2020-07-18 00:14:05,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2020-07-18 00:14:06,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:06,048 INFO L225 Difference]: With dead ends: 48 [2020-07-18 00:14:06,048 INFO L226 Difference]: Without dead ends: 30 [2020-07-18 00:14:06,052 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:14:06,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-18 00:14:06,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-18 00:14:06,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:06,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-18 00:14:06,121 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-18 00:14:06,121 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-18 00:14:06,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:06,128 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-18 00:14:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-18 00:14:06,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:06,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:06,130 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-18 00:14:06,130 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-18 00:14:06,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:06,135 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-18 00:14:06,135 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-18 00:14:06,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:06,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:06,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:06,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-18 00:14:06,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-18 00:14:06,142 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2020-07-18 00:14:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:06,142 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-18 00:14:06,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:14:06,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2020-07-18 00:14:06,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:06,193 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-18 00:14:06,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-18 00:14:06,194 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:06,194 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:14:06,194 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:14:06,195 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:06,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:06,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1678486471, now seen corresponding path program 1 times [2020-07-18 00:14:06,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:06,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [457889266] [2020-07-18 00:14:06,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:06,236 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#true} assume true; {268#true} is VALID [2020-07-18 00:14:06,236 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {268#true} {268#true} #44#return; {268#true} is VALID [2020-07-18 00:14:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:06,285 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#true} ~n := #in~n; {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 00:14:06,286 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 00:14:06,287 INFO L280 TraceCheckUtils]: 2: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 00:14:06,288 INFO L280 TraceCheckUtils]: 3: Hoare triple {280#(<= |fibonacci_#in~n| 1)} #res := 1; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 00:14:06,288 INFO L280 TraceCheckUtils]: 4: Hoare triple {280#(<= |fibonacci_#in~n| 1)} assume true; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 00:14:06,290 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {280#(<= |fibonacci_#in~n| 1)} {268#true} #48#return; {278#(<= main_~x~0 1)} is VALID [2020-07-18 00:14:06,290 INFO L263 TraceCheckUtils]: 0: Hoare triple {268#true} call ULTIMATE.init(); {268#true} is VALID [2020-07-18 00:14:06,291 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#true} assume true; {268#true} is VALID [2020-07-18 00:14:06,291 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {268#true} {268#true} #44#return; {268#true} is VALID [2020-07-18 00:14:06,291 INFO L263 TraceCheckUtils]: 3: Hoare triple {268#true} call #t~ret4 := main(); {268#true} is VALID [2020-07-18 00:14:06,292 INFO L280 TraceCheckUtils]: 4: Hoare triple {268#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {268#true} is VALID [2020-07-18 00:14:06,292 INFO L280 TraceCheckUtils]: 5: Hoare triple {268#true} ~x~0 := #t~nondet2; {268#true} is VALID [2020-07-18 00:14:06,292 INFO L280 TraceCheckUtils]: 6: Hoare triple {268#true} havoc #t~nondet2; {268#true} is VALID [2020-07-18 00:14:06,292 INFO L263 TraceCheckUtils]: 7: Hoare triple {268#true} call #t~ret3 := fibonacci(~x~0); {268#true} is VALID [2020-07-18 00:14:06,293 INFO L280 TraceCheckUtils]: 8: Hoare triple {268#true} ~n := #in~n; {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 00:14:06,294 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 00:14:06,295 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 00:14:06,295 INFO L280 TraceCheckUtils]: 11: Hoare triple {280#(<= |fibonacci_#in~n| 1)} #res := 1; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 00:14:06,296 INFO L280 TraceCheckUtils]: 12: Hoare triple {280#(<= |fibonacci_#in~n| 1)} assume true; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 00:14:06,297 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {280#(<= |fibonacci_#in~n| 1)} {268#true} #48#return; {278#(<= main_~x~0 1)} is VALID [2020-07-18 00:14:06,298 INFO L280 TraceCheckUtils]: 14: Hoare triple {278#(<= main_~x~0 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {278#(<= main_~x~0 1)} is VALID [2020-07-18 00:14:06,299 INFO L280 TraceCheckUtils]: 15: Hoare triple {278#(<= main_~x~0 1)} ~result~0 := #t~ret3; {278#(<= main_~x~0 1)} is VALID [2020-07-18 00:14:06,300 INFO L280 TraceCheckUtils]: 16: Hoare triple {278#(<= main_~x~0 1)} havoc #t~ret3; {278#(<= main_~x~0 1)} is VALID [2020-07-18 00:14:06,301 INFO L280 TraceCheckUtils]: 17: Hoare triple {278#(<= main_~x~0 1)} assume !(5 != ~x~0 || 3 == ~result~0); {269#false} is VALID [2020-07-18 00:14:06,301 INFO L280 TraceCheckUtils]: 18: Hoare triple {269#false} assume !false; {269#false} is VALID [2020-07-18 00:14:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:14:06,306 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:06,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [457889266] [2020-07-18 00:14:06,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:06,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:14:06,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065789665] [2020-07-18 00:14:06,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-18 00:14:06,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:06,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:14:06,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:06,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:14:06,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:06,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:14:06,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:14:06,334 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2020-07-18 00:14:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:06,527 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-18 00:14:06,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:14:06,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-18 00:14:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:14:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-18 00:14:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:14:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-18 00:14:06,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-18 00:14:06,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:06,586 INFO L225 Difference]: With dead ends: 38 [2020-07-18 00:14:06,587 INFO L226 Difference]: Without dead ends: 32 [2020-07-18 00:14:06,588 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:14:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-18 00:14:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-18 00:14:06,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:06,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2020-07-18 00:14:06,620 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2020-07-18 00:14:06,620 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2020-07-18 00:14:06,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:06,624 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-18 00:14:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-18 00:14:06,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:06,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:06,626 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2020-07-18 00:14:06,626 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2020-07-18 00:14:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:06,629 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-18 00:14:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-18 00:14:06,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:06,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:06,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:06,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:06,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-18 00:14:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-18 00:14:06,634 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2020-07-18 00:14:06,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:06,634 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-18 00:14:06,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:14:06,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2020-07-18 00:14:06,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:06,681 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-18 00:14:06,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 00:14:06,682 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:06,682 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1] [2020-07-18 00:14:06,682 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:14:06,683 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:06,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:06,683 INFO L82 PathProgramCache]: Analyzing trace with hash 961212118, now seen corresponding path program 1 times [2020-07-18 00:14:06,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:06,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1499712452] [2020-07-18 00:14:06,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:06,734 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-18 00:14:06,735 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {485#true} {485#true} #44#return; {485#true} is VALID [2020-07-18 00:14:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:06,826 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} ~n := #in~n; {523#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 00:14:06,828 INFO L280 TraceCheckUtils]: 1: Hoare triple {523#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:06,828 INFO L280 TraceCheckUtils]: 2: Hoare triple {524#(<= |fibonacci_#in~n| 0)} #res := 0; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:06,829 INFO L280 TraceCheckUtils]: 3: Hoare triple {524#(<= |fibonacci_#in~n| 0)} assume true; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:06,831 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {524#(<= |fibonacci_#in~n| 0)} {512#(< 1 fibonacci_~n)} #40#return; {486#false} is VALID [2020-07-18 00:14:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:06,842 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-18 00:14:06,842 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume ~n < 1; {485#true} is VALID [2020-07-18 00:14:06,843 INFO L280 TraceCheckUtils]: 2: Hoare triple {485#true} #res := 0; {485#true} is VALID [2020-07-18 00:14:06,843 INFO L280 TraceCheckUtils]: 3: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-18 00:14:06,844 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {485#true} {486#false} #42#return; {486#false} is VALID [2020-07-18 00:14:06,844 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-18 00:14:06,848 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume !(~n < 1); {511#(< 0 fibonacci_~n)} is VALID [2020-07-18 00:14:06,849 INFO L280 TraceCheckUtils]: 2: Hoare triple {511#(< 0 fibonacci_~n)} assume !(1 == ~n); {512#(< 1 fibonacci_~n)} is VALID [2020-07-18 00:14:06,850 INFO L263 TraceCheckUtils]: 3: Hoare triple {512#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {485#true} is VALID [2020-07-18 00:14:06,851 INFO L280 TraceCheckUtils]: 4: Hoare triple {485#true} ~n := #in~n; {523#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 00:14:06,852 INFO L280 TraceCheckUtils]: 5: Hoare triple {523#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:06,853 INFO L280 TraceCheckUtils]: 6: Hoare triple {524#(<= |fibonacci_#in~n| 0)} #res := 0; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:06,854 INFO L280 TraceCheckUtils]: 7: Hoare triple {524#(<= |fibonacci_#in~n| 0)} assume true; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:06,856 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {524#(<= |fibonacci_#in~n| 0)} {512#(< 1 fibonacci_~n)} #40#return; {486#false} is VALID [2020-07-18 00:14:06,856 INFO L280 TraceCheckUtils]: 9: Hoare triple {486#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {486#false} is VALID [2020-07-18 00:14:06,857 INFO L263 TraceCheckUtils]: 10: Hoare triple {486#false} call #t~ret1 := fibonacci(~n - 2); {485#true} is VALID [2020-07-18 00:14:06,857 INFO L280 TraceCheckUtils]: 11: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-18 00:14:06,858 INFO L280 TraceCheckUtils]: 12: Hoare triple {485#true} assume ~n < 1; {485#true} is VALID [2020-07-18 00:14:06,858 INFO L280 TraceCheckUtils]: 13: Hoare triple {485#true} #res := 0; {485#true} is VALID [2020-07-18 00:14:06,859 INFO L280 TraceCheckUtils]: 14: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-18 00:14:06,859 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {485#true} {486#false} #42#return; {486#false} is VALID [2020-07-18 00:14:06,859 INFO L280 TraceCheckUtils]: 16: Hoare triple {486#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {486#false} is VALID [2020-07-18 00:14:06,860 INFO L280 TraceCheckUtils]: 17: Hoare triple {486#false} #res := #t~ret0 + #t~ret1; {486#false} is VALID [2020-07-18 00:14:06,861 INFO L280 TraceCheckUtils]: 18: Hoare triple {486#false} havoc #t~ret0; {486#false} is VALID [2020-07-18 00:14:06,861 INFO L280 TraceCheckUtils]: 19: Hoare triple {486#false} havoc #t~ret1; {486#false} is VALID [2020-07-18 00:14:06,861 INFO L280 TraceCheckUtils]: 20: Hoare triple {486#false} assume true; {486#false} is VALID [2020-07-18 00:14:06,862 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {486#false} {485#true} #48#return; {486#false} is VALID [2020-07-18 00:14:06,866 INFO L263 TraceCheckUtils]: 0: Hoare triple {485#true} call ULTIMATE.init(); {485#true} is VALID [2020-07-18 00:14:06,866 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-18 00:14:06,866 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {485#true} {485#true} #44#return; {485#true} is VALID [2020-07-18 00:14:06,867 INFO L263 TraceCheckUtils]: 3: Hoare triple {485#true} call #t~ret4 := main(); {485#true} is VALID [2020-07-18 00:14:06,872 INFO L280 TraceCheckUtils]: 4: Hoare triple {485#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {485#true} is VALID [2020-07-18 00:14:06,872 INFO L280 TraceCheckUtils]: 5: Hoare triple {485#true} ~x~0 := #t~nondet2; {485#true} is VALID [2020-07-18 00:14:06,873 INFO L280 TraceCheckUtils]: 6: Hoare triple {485#true} havoc #t~nondet2; {485#true} is VALID [2020-07-18 00:14:06,873 INFO L263 TraceCheckUtils]: 7: Hoare triple {485#true} call #t~ret3 := fibonacci(~x~0); {485#true} is VALID [2020-07-18 00:14:06,873 INFO L280 TraceCheckUtils]: 8: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-18 00:14:06,877 INFO L280 TraceCheckUtils]: 9: Hoare triple {485#true} assume !(~n < 1); {511#(< 0 fibonacci_~n)} is VALID [2020-07-18 00:14:06,878 INFO L280 TraceCheckUtils]: 10: Hoare triple {511#(< 0 fibonacci_~n)} assume !(1 == ~n); {512#(< 1 fibonacci_~n)} is VALID [2020-07-18 00:14:06,879 INFO L263 TraceCheckUtils]: 11: Hoare triple {512#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {485#true} is VALID [2020-07-18 00:14:06,880 INFO L280 TraceCheckUtils]: 12: Hoare triple {485#true} ~n := #in~n; {523#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 00:14:06,881 INFO L280 TraceCheckUtils]: 13: Hoare triple {523#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:06,881 INFO L280 TraceCheckUtils]: 14: Hoare triple {524#(<= |fibonacci_#in~n| 0)} #res := 0; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:06,882 INFO L280 TraceCheckUtils]: 15: Hoare triple {524#(<= |fibonacci_#in~n| 0)} assume true; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:06,884 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {524#(<= |fibonacci_#in~n| 0)} {512#(< 1 fibonacci_~n)} #40#return; {486#false} is VALID [2020-07-18 00:14:06,884 INFO L280 TraceCheckUtils]: 17: Hoare triple {486#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {486#false} is VALID [2020-07-18 00:14:06,884 INFO L263 TraceCheckUtils]: 18: Hoare triple {486#false} call #t~ret1 := fibonacci(~n - 2); {485#true} is VALID [2020-07-18 00:14:06,885 INFO L280 TraceCheckUtils]: 19: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-18 00:14:06,885 INFO L280 TraceCheckUtils]: 20: Hoare triple {485#true} assume ~n < 1; {485#true} is VALID [2020-07-18 00:14:06,885 INFO L280 TraceCheckUtils]: 21: Hoare triple {485#true} #res := 0; {485#true} is VALID [2020-07-18 00:14:06,886 INFO L280 TraceCheckUtils]: 22: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-18 00:14:06,886 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {485#true} {486#false} #42#return; {486#false} is VALID [2020-07-18 00:14:06,889 INFO L280 TraceCheckUtils]: 24: Hoare triple {486#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {486#false} is VALID [2020-07-18 00:14:06,890 INFO L280 TraceCheckUtils]: 25: Hoare triple {486#false} #res := #t~ret0 + #t~ret1; {486#false} is VALID [2020-07-18 00:14:06,890 INFO L280 TraceCheckUtils]: 26: Hoare triple {486#false} havoc #t~ret0; {486#false} is VALID [2020-07-18 00:14:06,890 INFO L280 TraceCheckUtils]: 27: Hoare triple {486#false} havoc #t~ret1; {486#false} is VALID [2020-07-18 00:14:06,891 INFO L280 TraceCheckUtils]: 28: Hoare triple {486#false} assume true; {486#false} is VALID [2020-07-18 00:14:06,891 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {486#false} {485#true} #48#return; {486#false} is VALID [2020-07-18 00:14:06,891 INFO L280 TraceCheckUtils]: 30: Hoare triple {486#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {486#false} is VALID [2020-07-18 00:14:06,892 INFO L280 TraceCheckUtils]: 31: Hoare triple {486#false} ~result~0 := #t~ret3; {486#false} is VALID [2020-07-18 00:14:06,892 INFO L280 TraceCheckUtils]: 32: Hoare triple {486#false} havoc #t~ret3; {486#false} is VALID [2020-07-18 00:14:06,895 INFO L280 TraceCheckUtils]: 33: Hoare triple {486#false} assume !(5 != ~x~0 || 3 == ~result~0); {486#false} is VALID [2020-07-18 00:14:06,895 INFO L280 TraceCheckUtils]: 34: Hoare triple {486#false} assume !false; {486#false} is VALID [2020-07-18 00:14:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-18 00:14:07,112 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:07,112 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1499712452] [2020-07-18 00:14:07,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:07,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-18 00:14:07,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996348878] [2020-07-18 00:14:07,113 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2020-07-18 00:14:07,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:07,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-18 00:14:07,151 WARN L140 InductivityCheck]: Transition 531#(and (= 5 main_~x~0) (<= main_~result~0 2147483647) (not (= 3 main_~result~0)) (<= 0 (+ main_~result~0 2147483648))) ( _ , assume !false; , 486#false ) not inductive [2020-07-18 00:14:07,151 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:14:07,152 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:583) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:14:07,158 INFO L168 Benchmark]: Toolchain (without parser) took 2693.41 ms. Allocated memory was 138.9 MB in the beginning and 246.4 MB in the end (delta: 107.5 MB). Free memory was 104.6 MB in the beginning and 198.4 MB in the end (delta: -93.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:07,158 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 138.9 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 00:14:07,159 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.77 ms. Allocated memory is still 138.9 MB. Free memory was 104.1 MB in the beginning and 94.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:07,160 INFO L168 Benchmark]: Boogie Preprocessor took 26.01 ms. Allocated memory is still 138.9 MB. Free memory was 94.5 MB in the beginning and 93.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:07,161 INFO L168 Benchmark]: RCFGBuilder took 392.32 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 93.1 MB in the beginning and 164.8 MB in the end (delta: -71.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:07,162 INFO L168 Benchmark]: TraceAbstraction took 2032.16 ms. Allocated memory was 202.9 MB in the beginning and 246.4 MB in the end (delta: 43.5 MB). Free memory was 164.8 MB in the beginning and 198.4 MB in the end (delta: -33.6 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:07,166 INFO L336 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.13 ms. Allocated memory is still 138.9 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 235.77 ms. Allocated memory is still 138.9 MB. Free memory was 104.1 MB in the beginning and 94.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.01 ms. Allocated memory is still 138.9 MB. Free memory was 94.5 MB in the beginning and 93.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 392.32 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 93.1 MB in the beginning and 164.8 MB in the end (delta: -71.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2032.16 ms. Allocated memory was 202.9 MB in the beginning and 246.4 MB in the end (delta: 43.5 MB). Free memory was 164.8 MB in the beginning and 198.4 MB in the end (delta: -33.6 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...