/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/Fibonacci03.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:14:02,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:14:02,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:14:03,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:14:03,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:14:03,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:14:03,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:14:03,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:14:03,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:14:03,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:14:03,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:14:03,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:14:03,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:14:03,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:14:03,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:14:03,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:14:03,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:14:03,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:14:03,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:14:03,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:14:03,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:14:03,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:14:03,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:14:03,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:14:03,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:14:03,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:14:03,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:14:03,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:14:03,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:14:03,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:14:03,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:14:03,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:14:03,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:14:03,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:14:03,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:14:03,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:14:03,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:14:03,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:14:03,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:14:03,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:14:03,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:14:03,045 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,055 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:14:03,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:14:03,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:14:03,057 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:14:03,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:14:03,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:14:03,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:14:03,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:14:03,057 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:14:03,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:14:03,058 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:14:03,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:14:03,058 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:14:03,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:14:03,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:14:03,059 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:14:03,059 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:14:03,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:14:03,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:14:03,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:14:03,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:14:03,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:14:03,060 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:14:03,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:14:03,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:14:03,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:14:03,382 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:14:03,382 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:14:03,383 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci03.c [2020-07-18 00:14:03,458 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e72a17bd7/8b3c014ba116451e9306a806e9ed0b2f/FLAGe83c056a2 [2020-07-18 00:14:03,965 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:14:03,966 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci03.c [2020-07-18 00:14:03,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e72a17bd7/8b3c014ba116451e9306a806e9ed0b2f/FLAGe83c056a2 [2020-07-18 00:14:04,374 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e72a17bd7/8b3c014ba116451e9306a806e9ed0b2f [2020-07-18 00:14:04,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:14:04,388 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:14:04,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:04,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:14:04,393 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:14:04,394 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,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bea63f0 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,398 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,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:14:04,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:14:04,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:04,612 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:14:04,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:04,645 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:14:04,646 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,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:04,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:14:04,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:14:04,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:14:04,661 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,662 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,751 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,751 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,757 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,759 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,760 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,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:14:04,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:14:04,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:14:04,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:14:04,764 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,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:14:04,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:14:04,831 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-18 00:14:04,831 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:14:04,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:14:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:14:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-18 00:14:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:14:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:14:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:14:05,185 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:14:05,186 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 00:14:05,190 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,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:14:05,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:14:05,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:14:05,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:14:05,194 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,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c54ccf 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,195 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,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c54ccf 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,196 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,198 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci03.c [2020-07-18 00:14:05,209 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:14:05,217 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:14:05,232 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:14:05,253 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:14:05,254 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:14:05,254 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:14:05,254 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:14:05,254 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:14:05,254 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:14:05,255 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:14:05,255 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:14:05,270 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-18 00:14:05,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-18 00:14:05,282 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:05,283 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:05,284 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:05,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:05,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1379859160, now seen corresponding path program 1 times [2020-07-18 00:14:05,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:05,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1742634786] [2020-07-18 00:14:05,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:05,505 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-18 00:14:05,506 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {38#true} {38#true} #49#return; {38#true} is VALID [2020-07-18 00:14:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:05,560 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#true} ~n := #in~n; {48#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 00:14:05,562 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {49#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:05,563 INFO L280 TraceCheckUtils]: 2: Hoare triple {49#(<= |fibonacci_#in~n| 0)} #res := 0; {49#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:05,565 INFO L280 TraceCheckUtils]: 3: Hoare triple {49#(<= |fibonacci_#in~n| 0)} assume true; {49#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:05,567 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {49#(<= |fibonacci_#in~n| 0)} {38#true} #53#return; {47#(<= main_~x~0 0)} is VALID [2020-07-18 00:14:05,568 INFO L263 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {38#true} is VALID [2020-07-18 00:14:05,569 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-18 00:14:05,569 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #49#return; {38#true} is VALID [2020-07-18 00:14:05,570 INFO L263 TraceCheckUtils]: 3: Hoare triple {38#true} call #t~ret4 := main(); {38#true} is VALID [2020-07-18 00:14:05,570 INFO L280 TraceCheckUtils]: 4: Hoare triple {38#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {38#true} is VALID [2020-07-18 00:14:05,571 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#true} ~x~0 := #t~nondet2; {38#true} is VALID [2020-07-18 00:14:05,571 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#true} havoc #t~nondet2; {38#true} is VALID [2020-07-18 00:14:05,572 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#true} assume !(~x~0 > 46); {38#true} is VALID [2020-07-18 00:14:05,572 INFO L263 TraceCheckUtils]: 8: Hoare triple {38#true} call #t~ret3 := fibonacci(~x~0); {38#true} is VALID [2020-07-18 00:14:05,573 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#true} ~n := #in~n; {48#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 00:14:05,575 INFO L280 TraceCheckUtils]: 10: Hoare triple {48#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {49#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:05,578 INFO L280 TraceCheckUtils]: 11: Hoare triple {49#(<= |fibonacci_#in~n| 0)} #res := 0; {49#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:05,579 INFO L280 TraceCheckUtils]: 12: Hoare triple {49#(<= |fibonacci_#in~n| 0)} assume true; {49#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:05,581 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {49#(<= |fibonacci_#in~n| 0)} {38#true} #53#return; {47#(<= main_~x~0 0)} is VALID [2020-07-18 00:14:05,583 INFO L280 TraceCheckUtils]: 14: Hoare triple {47#(<= main_~x~0 0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {47#(<= main_~x~0 0)} is VALID [2020-07-18 00:14:05,584 INFO L280 TraceCheckUtils]: 15: Hoare triple {47#(<= main_~x~0 0)} ~result~0 := #t~ret3; {47#(<= main_~x~0 0)} is VALID [2020-07-18 00:14:05,585 INFO L280 TraceCheckUtils]: 16: Hoare triple {47#(<= main_~x~0 0)} havoc #t~ret3; {47#(<= main_~x~0 0)} is VALID [2020-07-18 00:14:05,587 INFO L280 TraceCheckUtils]: 17: Hoare triple {47#(<= main_~x~0 0)} assume !(~x~0 < 9 || ~result~0 >= 34); {39#false} is VALID [2020-07-18 00:14:05,588 INFO L280 TraceCheckUtils]: 18: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-18 00:14:05,591 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,602 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:05,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1742634786] [2020-07-18 00:14:05,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:05,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:14:05,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115919589] [2020-07-18 00:14:05,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-18 00:14:05,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:05,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:14:05,663 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:05,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:14:05,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:05,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:14:05,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:14:05,678 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 5 states. [2020-07-18 00:14:06,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:06,024 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-07-18 00:14:06,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:14:06,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-18 00:14:06,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:14:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2020-07-18 00:14:06,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:14:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2020-07-18 00:14:06,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2020-07-18 00:14:06,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:06,150 INFO L225 Difference]: With dead ends: 50 [2020-07-18 00:14:06,151 INFO L226 Difference]: Without dead ends: 31 [2020-07-18 00:14:06,154 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,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-18 00:14:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-18 00:14:06,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:06,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-18 00:14:06,229 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-18 00:14:06,229 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-18 00:14:06,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:06,236 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-18 00:14:06,236 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-18 00:14:06,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:06,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:06,238 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-18 00:14:06,238 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-18 00:14:06,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:06,243 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-18 00:14:06,243 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-18 00:14:06,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:06,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:06,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:06,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:06,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-18 00:14:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-18 00:14:06,251 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 19 [2020-07-18 00:14:06,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:06,252 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-18 00:14:06,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:14:06,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 35 transitions. [2020-07-18 00:14:06,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-18 00:14:06,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-18 00:14:06,305 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:06,305 INFO L422 BasicCegarLoop]: trace histogram [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,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:14:06,306 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:06,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:06,307 INFO L82 PathProgramCache]: Analyzing trace with hash -2056866127, now seen corresponding path program 1 times [2020-07-18 00:14:06,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:06,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [884411930] [2020-07-18 00:14:06,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:06,366 INFO L280 TraceCheckUtils]: 0: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-18 00:14:06,367 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {278#true} {278#true} #49#return; {278#true} is VALID [2020-07-18 00:14:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:06,413 INFO L280 TraceCheckUtils]: 0: Hoare triple {278#true} ~n := #in~n; {289#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 00:14:06,414 INFO L280 TraceCheckUtils]: 1: Hoare triple {289#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {289#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 00:14:06,415 INFO L280 TraceCheckUtils]: 2: Hoare triple {289#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {290#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 00:14:06,416 INFO L280 TraceCheckUtils]: 3: Hoare triple {290#(<= |fibonacci_#in~n| 1)} #res := 1; {290#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 00:14:06,417 INFO L280 TraceCheckUtils]: 4: Hoare triple {290#(<= |fibonacci_#in~n| 1)} assume true; {290#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 00:14:06,418 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {290#(<= |fibonacci_#in~n| 1)} {278#true} #53#return; {288#(<= main_~x~0 1)} is VALID [2020-07-18 00:14:06,419 INFO L263 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {278#true} is VALID [2020-07-18 00:14:06,419 INFO L280 TraceCheckUtils]: 1: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-18 00:14:06,419 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {278#true} {278#true} #49#return; {278#true} is VALID [2020-07-18 00:14:06,420 INFO L263 TraceCheckUtils]: 3: Hoare triple {278#true} call #t~ret4 := main(); {278#true} is VALID [2020-07-18 00:14:06,420 INFO L280 TraceCheckUtils]: 4: Hoare triple {278#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {278#true} is VALID [2020-07-18 00:14:06,420 INFO L280 TraceCheckUtils]: 5: Hoare triple {278#true} ~x~0 := #t~nondet2; {278#true} is VALID [2020-07-18 00:14:06,421 INFO L280 TraceCheckUtils]: 6: Hoare triple {278#true} havoc #t~nondet2; {278#true} is VALID [2020-07-18 00:14:06,421 INFO L280 TraceCheckUtils]: 7: Hoare triple {278#true} assume !(~x~0 > 46); {278#true} is VALID [2020-07-18 00:14:06,421 INFO L263 TraceCheckUtils]: 8: Hoare triple {278#true} call #t~ret3 := fibonacci(~x~0); {278#true} is VALID [2020-07-18 00:14:06,422 INFO L280 TraceCheckUtils]: 9: Hoare triple {278#true} ~n := #in~n; {289#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 00:14:06,423 INFO L280 TraceCheckUtils]: 10: Hoare triple {289#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {289#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 00:14:06,424 INFO L280 TraceCheckUtils]: 11: Hoare triple {289#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {290#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 00:14:06,424 INFO L280 TraceCheckUtils]: 12: Hoare triple {290#(<= |fibonacci_#in~n| 1)} #res := 1; {290#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 00:14:06,425 INFO L280 TraceCheckUtils]: 13: Hoare triple {290#(<= |fibonacci_#in~n| 1)} assume true; {290#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 00:14:06,426 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {290#(<= |fibonacci_#in~n| 1)} {278#true} #53#return; {288#(<= main_~x~0 1)} is VALID [2020-07-18 00:14:06,427 INFO L280 TraceCheckUtils]: 15: Hoare triple {288#(<= main_~x~0 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {288#(<= main_~x~0 1)} is VALID [2020-07-18 00:14:06,428 INFO L280 TraceCheckUtils]: 16: Hoare triple {288#(<= main_~x~0 1)} ~result~0 := #t~ret3; {288#(<= main_~x~0 1)} is VALID [2020-07-18 00:14:06,429 INFO L280 TraceCheckUtils]: 17: Hoare triple {288#(<= main_~x~0 1)} havoc #t~ret3; {288#(<= main_~x~0 1)} is VALID [2020-07-18 00:14:06,430 INFO L280 TraceCheckUtils]: 18: Hoare triple {288#(<= main_~x~0 1)} assume !(~x~0 < 9 || ~result~0 >= 34); {279#false} is VALID [2020-07-18 00:14:06,430 INFO L280 TraceCheckUtils]: 19: Hoare triple {279#false} assume !false; {279#false} is VALID [2020-07-18 00:14:06,432 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,439 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:06,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [884411930] [2020-07-18 00:14:06,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:06,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:14:06,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641146284] [2020-07-18 00:14:06,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-18 00:14:06,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:06,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:14:06,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:06,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:14:06,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:06,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:14:06,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:14:06,468 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 5 states. [2020-07-18 00:14:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:06,674 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-18 00:14:06,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:14:06,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-18 00:14:06,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:14:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-18 00:14:06,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:14:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-18 00:14:06,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2020-07-18 00:14:06,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:06,740 INFO L225 Difference]: With dead ends: 39 [2020-07-18 00:14:06,740 INFO L226 Difference]: Without dead ends: 33 [2020-07-18 00:14:06,742 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,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-18 00:14:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2020-07-18 00:14:06,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:06,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 31 states. [2020-07-18 00:14:06,789 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 31 states. [2020-07-18 00:14:06,789 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 31 states. [2020-07-18 00:14:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:06,793 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-18 00:14:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2020-07-18 00:14:06,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:06,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:06,795 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 33 states. [2020-07-18 00:14:06,795 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 33 states. [2020-07-18 00:14:06,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:06,799 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-18 00:14:06,799 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2020-07-18 00:14:06,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:06,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:06,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:06,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-18 00:14:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-18 00:14:06,804 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2020-07-18 00:14:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:06,804 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-18 00:14:06,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:14:06,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 35 transitions. [2020-07-18 00:14:06,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:06,855 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-18 00:14:06,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-18 00:14:06,856 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:06,857 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, 1] [2020-07-18 00:14:06,857 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:14:06,857 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:06,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:06,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1274124978, now seen corresponding path program 1 times [2020-07-18 00:14:06,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:06,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [628546985] [2020-07-18 00:14:06,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:06,897 INFO L280 TraceCheckUtils]: 0: Hoare triple {501#true} assume true; {501#true} is VALID [2020-07-18 00:14:06,898 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {501#true} {501#true} #49#return; {501#true} is VALID [2020-07-18 00:14:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:06,979 INFO L280 TraceCheckUtils]: 0: Hoare triple {501#true} ~n := #in~n; {539#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 00:14:06,981 INFO L280 TraceCheckUtils]: 1: Hoare triple {539#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {540#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:06,982 INFO L280 TraceCheckUtils]: 2: Hoare triple {540#(<= |fibonacci_#in~n| 0)} #res := 0; {540#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:06,982 INFO L280 TraceCheckUtils]: 3: Hoare triple {540#(<= |fibonacci_#in~n| 0)} assume true; {540#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:06,984 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {540#(<= |fibonacci_#in~n| 0)} {528#(< 1 fibonacci_~n)} #45#return; {502#false} is VALID [2020-07-18 00:14:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:06,991 INFO L280 TraceCheckUtils]: 0: Hoare triple {501#true} ~n := #in~n; {501#true} is VALID [2020-07-18 00:14:06,991 INFO L280 TraceCheckUtils]: 1: Hoare triple {501#true} assume ~n < 1; {501#true} is VALID [2020-07-18 00:14:06,992 INFO L280 TraceCheckUtils]: 2: Hoare triple {501#true} #res := 0; {501#true} is VALID [2020-07-18 00:14:06,992 INFO L280 TraceCheckUtils]: 3: Hoare triple {501#true} assume true; {501#true} is VALID [2020-07-18 00:14:06,993 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {501#true} {502#false} #47#return; {502#false} is VALID [2020-07-18 00:14:06,993 INFO L280 TraceCheckUtils]: 0: Hoare triple {501#true} ~n := #in~n; {501#true} is VALID [2020-07-18 00:14:06,994 INFO L280 TraceCheckUtils]: 1: Hoare triple {501#true} assume !(~n < 1); {527#(< 0 fibonacci_~n)} is VALID [2020-07-18 00:14:06,996 INFO L280 TraceCheckUtils]: 2: Hoare triple {527#(< 0 fibonacci_~n)} assume !(1 == ~n); {528#(< 1 fibonacci_~n)} is VALID [2020-07-18 00:14:06,996 INFO L263 TraceCheckUtils]: 3: Hoare triple {528#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {501#true} is VALID [2020-07-18 00:14:06,997 INFO L280 TraceCheckUtils]: 4: Hoare triple {501#true} ~n := #in~n; {539#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 00:14:06,998 INFO L280 TraceCheckUtils]: 5: Hoare triple {539#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {540#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:06,999 INFO L280 TraceCheckUtils]: 6: Hoare triple {540#(<= |fibonacci_#in~n| 0)} #res := 0; {540#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:07,000 INFO L280 TraceCheckUtils]: 7: Hoare triple {540#(<= |fibonacci_#in~n| 0)} assume true; {540#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:07,001 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {540#(<= |fibonacci_#in~n| 0)} {528#(< 1 fibonacci_~n)} #45#return; {502#false} is VALID [2020-07-18 00:14:07,002 INFO L280 TraceCheckUtils]: 9: Hoare triple {502#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {502#false} is VALID [2020-07-18 00:14:07,002 INFO L263 TraceCheckUtils]: 10: Hoare triple {502#false} call #t~ret1 := fibonacci(~n - 2); {501#true} is VALID [2020-07-18 00:14:07,003 INFO L280 TraceCheckUtils]: 11: Hoare triple {501#true} ~n := #in~n; {501#true} is VALID [2020-07-18 00:14:07,003 INFO L280 TraceCheckUtils]: 12: Hoare triple {501#true} assume ~n < 1; {501#true} is VALID [2020-07-18 00:14:07,003 INFO L280 TraceCheckUtils]: 13: Hoare triple {501#true} #res := 0; {501#true} is VALID [2020-07-18 00:14:07,004 INFO L280 TraceCheckUtils]: 14: Hoare triple {501#true} assume true; {501#true} is VALID [2020-07-18 00:14:07,004 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {501#true} {502#false} #47#return; {502#false} is VALID [2020-07-18 00:14:07,004 INFO L280 TraceCheckUtils]: 16: Hoare triple {502#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {502#false} is VALID [2020-07-18 00:14:07,005 INFO L280 TraceCheckUtils]: 17: Hoare triple {502#false} #res := #t~ret0 + #t~ret1; {502#false} is VALID [2020-07-18 00:14:07,005 INFO L280 TraceCheckUtils]: 18: Hoare triple {502#false} havoc #t~ret0; {502#false} is VALID [2020-07-18 00:14:07,006 INFO L280 TraceCheckUtils]: 19: Hoare triple {502#false} havoc #t~ret1; {502#false} is VALID [2020-07-18 00:14:07,006 INFO L280 TraceCheckUtils]: 20: Hoare triple {502#false} assume true; {502#false} is VALID [2020-07-18 00:14:07,006 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {502#false} {501#true} #53#return; {502#false} is VALID [2020-07-18 00:14:07,008 INFO L263 TraceCheckUtils]: 0: Hoare triple {501#true} call ULTIMATE.init(); {501#true} is VALID [2020-07-18 00:14:07,008 INFO L280 TraceCheckUtils]: 1: Hoare triple {501#true} assume true; {501#true} is VALID [2020-07-18 00:14:07,009 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {501#true} {501#true} #49#return; {501#true} is VALID [2020-07-18 00:14:07,009 INFO L263 TraceCheckUtils]: 3: Hoare triple {501#true} call #t~ret4 := main(); {501#true} is VALID [2020-07-18 00:14:07,009 INFO L280 TraceCheckUtils]: 4: Hoare triple {501#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {501#true} is VALID [2020-07-18 00:14:07,010 INFO L280 TraceCheckUtils]: 5: Hoare triple {501#true} ~x~0 := #t~nondet2; {501#true} is VALID [2020-07-18 00:14:07,010 INFO L280 TraceCheckUtils]: 6: Hoare triple {501#true} havoc #t~nondet2; {501#true} is VALID [2020-07-18 00:14:07,011 INFO L280 TraceCheckUtils]: 7: Hoare triple {501#true} assume !(~x~0 > 46); {501#true} is VALID [2020-07-18 00:14:07,011 INFO L263 TraceCheckUtils]: 8: Hoare triple {501#true} call #t~ret3 := fibonacci(~x~0); {501#true} is VALID [2020-07-18 00:14:07,011 INFO L280 TraceCheckUtils]: 9: Hoare triple {501#true} ~n := #in~n; {501#true} is VALID [2020-07-18 00:14:07,013 INFO L280 TraceCheckUtils]: 10: Hoare triple {501#true} assume !(~n < 1); {527#(< 0 fibonacci_~n)} is VALID [2020-07-18 00:14:07,014 INFO L280 TraceCheckUtils]: 11: Hoare triple {527#(< 0 fibonacci_~n)} assume !(1 == ~n); {528#(< 1 fibonacci_~n)} is VALID [2020-07-18 00:14:07,014 INFO L263 TraceCheckUtils]: 12: Hoare triple {528#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {501#true} is VALID [2020-07-18 00:14:07,015 INFO L280 TraceCheckUtils]: 13: Hoare triple {501#true} ~n := #in~n; {539#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 00:14:07,016 INFO L280 TraceCheckUtils]: 14: Hoare triple {539#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {540#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:07,017 INFO L280 TraceCheckUtils]: 15: Hoare triple {540#(<= |fibonacci_#in~n| 0)} #res := 0; {540#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:07,018 INFO L280 TraceCheckUtils]: 16: Hoare triple {540#(<= |fibonacci_#in~n| 0)} assume true; {540#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 00:14:07,019 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {540#(<= |fibonacci_#in~n| 0)} {528#(< 1 fibonacci_~n)} #45#return; {502#false} is VALID [2020-07-18 00:14:07,020 INFO L280 TraceCheckUtils]: 18: Hoare triple {502#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {502#false} is VALID [2020-07-18 00:14:07,020 INFO L263 TraceCheckUtils]: 19: Hoare triple {502#false} call #t~ret1 := fibonacci(~n - 2); {501#true} is VALID [2020-07-18 00:14:07,021 INFO L280 TraceCheckUtils]: 20: Hoare triple {501#true} ~n := #in~n; {501#true} is VALID [2020-07-18 00:14:07,021 INFO L280 TraceCheckUtils]: 21: Hoare triple {501#true} assume ~n < 1; {501#true} is VALID [2020-07-18 00:14:07,021 INFO L280 TraceCheckUtils]: 22: Hoare triple {501#true} #res := 0; {501#true} is VALID [2020-07-18 00:14:07,022 INFO L280 TraceCheckUtils]: 23: Hoare triple {501#true} assume true; {501#true} is VALID [2020-07-18 00:14:07,022 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {501#true} {502#false} #47#return; {502#false} is VALID [2020-07-18 00:14:07,022 INFO L280 TraceCheckUtils]: 25: Hoare triple {502#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {502#false} is VALID [2020-07-18 00:14:07,023 INFO L280 TraceCheckUtils]: 26: Hoare triple {502#false} #res := #t~ret0 + #t~ret1; {502#false} is VALID [2020-07-18 00:14:07,023 INFO L280 TraceCheckUtils]: 27: Hoare triple {502#false} havoc #t~ret0; {502#false} is VALID [2020-07-18 00:14:07,023 INFO L280 TraceCheckUtils]: 28: Hoare triple {502#false} havoc #t~ret1; {502#false} is VALID [2020-07-18 00:14:07,024 INFO L280 TraceCheckUtils]: 29: Hoare triple {502#false} assume true; {502#false} is VALID [2020-07-18 00:14:07,024 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {502#false} {501#true} #53#return; {502#false} is VALID [2020-07-18 00:14:07,024 INFO L280 TraceCheckUtils]: 31: Hoare triple {502#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {502#false} is VALID [2020-07-18 00:14:07,025 INFO L280 TraceCheckUtils]: 32: Hoare triple {502#false} ~result~0 := #t~ret3; {502#false} is VALID [2020-07-18 00:14:07,025 INFO L280 TraceCheckUtils]: 33: Hoare triple {502#false} havoc #t~ret3; {502#false} is VALID [2020-07-18 00:14:07,025 INFO L280 TraceCheckUtils]: 34: Hoare triple {502#false} assume !(~x~0 < 9 || ~result~0 >= 34); {502#false} is VALID [2020-07-18 00:14:07,026 INFO L280 TraceCheckUtils]: 35: Hoare triple {502#false} assume !false; {502#false} is VALID [2020-07-18 00:14:07,029 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,246 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:07,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [628546985] [2020-07-18 00:14:07,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:07,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-18 00:14:07,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292192123] [2020-07-18 00:14:07,248 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2020-07-18 00:14:07,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:07,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-18 00:14:07,255 WARN L140 InductivityCheck]: Transition 547#(and (< main_~result~0 34) (<= 9 main_~x~0) (<= 0 (+ main_~result~0 2147483648))) ( _ , assume !false; , 502#false ) not inductive [2020-07-18 00:14:07,255 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:14:07,256 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,262 INFO L168 Benchmark]: Toolchain (without parser) took 2875.32 ms. Allocated memory was 137.4 MB in the beginning and 249.0 MB in the end (delta: 111.7 MB). Free memory was 102.8 MB in the beginning and 199.6 MB in the end (delta: -96.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:07,263 INFO L168 Benchmark]: CDTParser took 1.48 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 00:14:07,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.89 ms. Allocated memory is still 137.4 MB. Free memory was 102.4 MB in the beginning and 92.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:07,265 INFO L168 Benchmark]: Boogie Preprocessor took 115.37 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 92.9 MB in the beginning and 180.0 MB in the end (delta: -87.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:07,266 INFO L168 Benchmark]: RCFGBuilder took 427.53 ms. Allocated memory is still 200.8 MB. Free memory was 179.6 MB in the beginning and 160.8 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:07,267 INFO L168 Benchmark]: TraceAbstraction took 2068.01 ms. Allocated memory was 200.8 MB in the beginning and 249.0 MB in the end (delta: 48.2 MB). Free memory was 160.1 MB in the beginning and 199.6 MB in the end (delta: -39.5 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:07,271 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 1.48 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 257.89 ms. Allocated memory is still 137.4 MB. Free memory was 102.4 MB in the beginning and 92.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.37 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 92.9 MB in the beginning and 180.0 MB in the end (delta: -87.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 427.53 ms. Allocated memory is still 200.8 MB. Free memory was 179.6 MB in the beginning and 160.8 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2068.01 ms. Allocated memory was 200.8 MB in the beginning and 249.0 MB in the end (delta: 48.2 MB). Free memory was 160.1 MB in the beginning and 199.6 MB in the end (delta: -39.5 MB). Peak memory consumption was 8.8 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...