/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_2-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 22:01:51,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 22:01:51,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 22:01:51,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 22:01:51,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 22:01:51,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 22:01:51,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 22:01:51,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 22:01:51,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 22:01:51,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 22:01:51,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 22:01:51,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 22:01:51,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 22:01:51,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 22:01:51,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 22:01:51,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 22:01:51,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 22:01:51,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 22:01:51,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 22:01:51,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 22:01:51,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 22:01:51,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 22:01:51,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 22:01:51,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 22:01:51,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 22:01:51,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 22:01:51,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 22:01:51,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 22:01:51,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 22:01:51,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 22:01:51,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 22:01:51,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 22:01:51,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 22:01:51,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 22:01:51,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 22:01:51,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 22:01:51,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 22:01:51,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 22:01:51,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 22:01:51,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 22:01:51,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 22:01:51,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 22:01:51,251 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 22:01:51,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 22:01:51,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 22:01:51,253 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 22:01:51,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 22:01:51,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 22:01:51,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 22:01:51,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 22:01:51,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 22:01:51,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 22:01:51,255 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 22:01:51,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 22:01:51,255 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 22:01:51,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 22:01:51,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 22:01:51,256 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 22:01:51,256 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 22:01:51,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 22:01:51,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 22:01:51,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 22:01:51,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 22:01:51,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 22:01:51,257 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 22:01:51,543 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 22:01:51,566 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 22:01:51,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 22:01:51,572 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 22:01:51,572 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 22:01:51,573 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_2-1.c [2020-07-08 22:01:51,662 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a031a5046/37e4e954f13a4fde8a16a1a35ad41829/FLAG990ae0bc2 [2020-07-08 22:01:52,190 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 22:01:52,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_2-1.c [2020-07-08 22:01:52,199 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a031a5046/37e4e954f13a4fde8a16a1a35ad41829/FLAG990ae0bc2 [2020-07-08 22:01:52,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a031a5046/37e4e954f13a4fde8a16a1a35ad41829 [2020-07-08 22:01:52,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 22:01:52,556 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 22:01:52,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 22:01:52,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 22:01:52,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 22:01:52,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:01:52" (1/1) ... [2020-07-08 22:01:52,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74465d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:01:52, skipping insertion in model container [2020-07-08 22:01:52,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:01:52" (1/1) ... [2020-07-08 22:01:52,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 22:01:52,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 22:01:52,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:01:52,775 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 22:01:52,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:01:52,808 INFO L208 MainTranslator]: Completed translation [2020-07-08 22:01:52,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:01:52 WrapperNode [2020-07-08 22:01:52,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 22:01:52,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 22:01:52,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 22:01:52,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 22:01:52,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:01:52" (1/1) ... [2020-07-08 22:01:52,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:01:52" (1/1) ... [2020-07-08 22:01:52,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:01:52" (1/1) ... [2020-07-08 22:01:52,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:01:52" (1/1) ... [2020-07-08 22:01:52,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:01:52" (1/1) ... [2020-07-08 22:01:52,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:01:52" (1/1) ... [2020-07-08 22:01:52,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:01:52" (1/1) ... [2020-07-08 22:01:52,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 22:01:52,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 22:01:52,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 22:01:52,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 22:01:52,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:01:52" (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-08 22:01:53,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 22:01:53,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 22:01:53,014 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-08 22:01:53,015 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-08 22:01:53,015 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 22:01:53,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 22:01:53,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 22:01:53,015 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-08 22:01:53,015 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-08 22:01:53,015 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 22:01:53,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 22:01:53,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 22:01:53,348 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 22:01:53,348 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 22:01:53,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:01:53 BoogieIcfgContainer [2020-07-08 22:01:53,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 22:01:53,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 22:01:53,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 22:01:53,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 22:01:53,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 10:01:52" (1/3) ... [2020-07-08 22:01:53,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4609243e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:01:53, skipping insertion in model container [2020-07-08 22:01:53,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:01:52" (2/3) ... [2020-07-08 22:01:53,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4609243e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:01:53, skipping insertion in model container [2020-07-08 22:01:53,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:01:53" (3/3) ... [2020-07-08 22:01:53,362 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-1.c [2020-07-08 22:01:53,373 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 22:01:53,386 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 22:01:53,418 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 22:01:53,442 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 22:01:53,442 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 22:01:53,442 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 22:01:53,442 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 22:01:53,442 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 22:01:53,443 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 22:01:53,443 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 22:01:53,443 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 22:01:53,460 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-08 22:01:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-08 22:01:53,471 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:01:53,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:01:53,473 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:01:53,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:01:53,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-07-08 22:01:53,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:01:53,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1477200708] [2020-07-08 22:01:53,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:01:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:01:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:01:53,746 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-08 22:01:53,748 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {48#true} {48#true} #59#return; {48#true} is VALID [2020-07-08 22:01:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:01:53,807 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#true} ~n := #in~n; {58#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:01:53,809 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:01:53,810 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#(<= |fibo1_#in~n| 0)} #res := 0; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:01:53,811 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#(<= |fibo1_#in~n| 0)} assume true; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:01:53,814 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {59#(<= |fibo1_#in~n| 0)} {52#(<= 2 main_~x~0)} #63#return; {49#false} is VALID [2020-07-08 22:01:53,815 INFO L263 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2020-07-08 22:01:53,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-08 22:01:53,816 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} #59#return; {48#true} is VALID [2020-07-08 22:01:53,817 INFO L263 TraceCheckUtils]: 3: Hoare triple {48#true} call #t~ret5 := main(); {48#true} is VALID [2020-07-08 22:01:53,818 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#true} ~x~0 := 2; {52#(<= 2 main_~x~0)} is VALID [2020-07-08 22:01:53,819 INFO L263 TraceCheckUtils]: 5: Hoare triple {52#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {48#true} is VALID [2020-07-08 22:01:53,820 INFO L280 TraceCheckUtils]: 6: Hoare triple {48#true} ~n := #in~n; {58#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:01:53,822 INFO L280 TraceCheckUtils]: 7: Hoare triple {58#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:01:53,823 INFO L280 TraceCheckUtils]: 8: Hoare triple {59#(<= |fibo1_#in~n| 0)} #res := 0; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:01:53,824 INFO L280 TraceCheckUtils]: 9: Hoare triple {59#(<= |fibo1_#in~n| 0)} assume true; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:01:53,827 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {59#(<= |fibo1_#in~n| 0)} {52#(<= 2 main_~x~0)} #63#return; {49#false} is VALID [2020-07-08 22:01:53,827 INFO L280 TraceCheckUtils]: 11: Hoare triple {49#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {49#false} is VALID [2020-07-08 22:01:53,828 INFO L280 TraceCheckUtils]: 12: Hoare triple {49#false} ~result~0 := #t~ret4; {49#false} is VALID [2020-07-08 22:01:53,829 INFO L280 TraceCheckUtils]: 13: Hoare triple {49#false} havoc #t~ret4; {49#false} is VALID [2020-07-08 22:01:53,829 INFO L280 TraceCheckUtils]: 14: Hoare triple {49#false} assume 1 == ~result~0; {49#false} is VALID [2020-07-08 22:01:53,830 INFO L280 TraceCheckUtils]: 15: Hoare triple {49#false} assume !false; {49#false} is VALID [2020-07-08 22:01:53,832 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-08 22:01:53,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1477200708] [2020-07-08 22:01:53,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:01:53,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 22:01:53,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937102780] [2020-07-08 22:01:53,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-08 22:01:53,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:01:53,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 22:01:53,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:01:53,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 22:01:53,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:01:53,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 22:01:53,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 22:01:53,915 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-07-08 22:01:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:01:54,396 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-07-08 22:01:54,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 22:01:54,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-08 22:01:54,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:01:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:01:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-08 22:01:54,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:01:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-08 22:01:54,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2020-07-08 22:01:54,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:01:54,576 INFO L225 Difference]: With dead ends: 58 [2020-07-08 22:01:54,576 INFO L226 Difference]: Without dead ends: 42 [2020-07-08 22:01:54,587 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 22:01:54,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-08 22:01:54,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-08 22:01:54,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:01:54,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2020-07-08 22:01:54,726 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-08 22:01:54,726 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-08 22:01:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:01:54,745 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-08 22:01:54,747 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-08 22:01:54,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:01:54,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:01:54,749 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-08 22:01:54,750 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-08 22:01:54,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:01:54,768 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-08 22:01:54,768 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-08 22:01:54,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:01:54,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:01:54,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:01:54,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:01:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-08 22:01:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-07-08 22:01:54,788 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-07-08 22:01:54,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:01:54,789 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-07-08 22:01:54,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 22:01:54,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2020-07-08 22:01:54,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:01:54,858 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-08 22:01:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-08 22:01:54,860 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:01:54,861 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:01:54,861 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 22:01:54,861 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:01:54,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:01:54,862 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-07-08 22:01:54,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:01:54,863 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [246658055] [2020-07-08 22:01:54,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:01:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:01:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:01:54,915 INFO L280 TraceCheckUtils]: 0: Hoare triple {348#true} assume true; {348#true} is VALID [2020-07-08 22:01:54,915 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {348#true} {348#true} #59#return; {348#true} is VALID [2020-07-08 22:01:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:01:54,946 INFO L280 TraceCheckUtils]: 0: Hoare triple {348#true} ~n := #in~n; {359#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:01:54,947 INFO L280 TraceCheckUtils]: 1: Hoare triple {359#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {359#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:01:54,948 INFO L280 TraceCheckUtils]: 2: Hoare triple {359#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 22:01:54,948 INFO L280 TraceCheckUtils]: 3: Hoare triple {360#(<= |fibo1_#in~n| 1)} #res := 1; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 22:01:54,949 INFO L280 TraceCheckUtils]: 4: Hoare triple {360#(<= |fibo1_#in~n| 1)} assume true; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 22:01:54,950 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {360#(<= |fibo1_#in~n| 1)} {352#(<= 2 main_~x~0)} #63#return; {349#false} is VALID [2020-07-08 22:01:54,951 INFO L263 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2020-07-08 22:01:54,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {348#true} assume true; {348#true} is VALID [2020-07-08 22:01:54,952 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {348#true} {348#true} #59#return; {348#true} is VALID [2020-07-08 22:01:54,952 INFO L263 TraceCheckUtils]: 3: Hoare triple {348#true} call #t~ret5 := main(); {348#true} is VALID [2020-07-08 22:01:54,953 INFO L280 TraceCheckUtils]: 4: Hoare triple {348#true} ~x~0 := 2; {352#(<= 2 main_~x~0)} is VALID [2020-07-08 22:01:54,953 INFO L263 TraceCheckUtils]: 5: Hoare triple {352#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {348#true} is VALID [2020-07-08 22:01:54,954 INFO L280 TraceCheckUtils]: 6: Hoare triple {348#true} ~n := #in~n; {359#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:01:54,955 INFO L280 TraceCheckUtils]: 7: Hoare triple {359#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {359#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:01:54,956 INFO L280 TraceCheckUtils]: 8: Hoare triple {359#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 22:01:54,956 INFO L280 TraceCheckUtils]: 9: Hoare triple {360#(<= |fibo1_#in~n| 1)} #res := 1; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 22:01:54,957 INFO L280 TraceCheckUtils]: 10: Hoare triple {360#(<= |fibo1_#in~n| 1)} assume true; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 22:01:54,958 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {360#(<= |fibo1_#in~n| 1)} {352#(<= 2 main_~x~0)} #63#return; {349#false} is VALID [2020-07-08 22:01:54,959 INFO L280 TraceCheckUtils]: 12: Hoare triple {349#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {349#false} is VALID [2020-07-08 22:01:54,959 INFO L280 TraceCheckUtils]: 13: Hoare triple {349#false} ~result~0 := #t~ret4; {349#false} is VALID [2020-07-08 22:01:54,959 INFO L280 TraceCheckUtils]: 14: Hoare triple {349#false} havoc #t~ret4; {349#false} is VALID [2020-07-08 22:01:54,960 INFO L280 TraceCheckUtils]: 15: Hoare triple {349#false} assume 1 == ~result~0; {349#false} is VALID [2020-07-08 22:01:54,960 INFO L280 TraceCheckUtils]: 16: Hoare triple {349#false} assume !false; {349#false} is VALID [2020-07-08 22:01:54,961 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-08 22:01:54,962 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [246658055] [2020-07-08 22:01:54,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:01:54,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 22:01:54,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876528192] [2020-07-08 22:01:54,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-08 22:01:54,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:01:54,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 22:01:54,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:01:54,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 22:01:54,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:01:54,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 22:01:54,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 22:01:54,991 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-07-08 22:01:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:01:55,268 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-08 22:01:55,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 22:01:55,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-08 22:01:55,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:01:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:01:55,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2020-07-08 22:01:55,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:01:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2020-07-08 22:01:55,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2020-07-08 22:01:55,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:01:55,350 INFO L225 Difference]: With dead ends: 50 [2020-07-08 22:01:55,350 INFO L226 Difference]: Without dead ends: 44 [2020-07-08 22:01:55,352 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 22:01:55,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-08 22:01:55,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-08 22:01:55,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:01:55,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-08 22:01:55,409 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-08 22:01:55,410 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-08 22:01:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:01:55,415 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-07-08 22:01:55,415 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-08 22:01:55,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:01:55,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:01:55,417 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-08 22:01:55,417 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-08 22:01:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:01:55,422 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-07-08 22:01:55,423 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-08 22:01:55,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:01:55,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:01:55,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:01:55,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:01:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-08 22:01:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-07-08 22:01:55,429 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-07-08 22:01:55,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:01:55,429 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-07-08 22:01:55,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 22:01:55,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2020-07-08 22:01:55,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:01:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-08 22:01:55,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-08 22:01:55,497 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:01:55,497 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:01:55,498 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 22:01:55,498 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:01:55,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:01:55,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-07-08 22:01:55,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:01:55,499 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [866692669] [2020-07-08 22:01:55,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:01:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:01:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:01:55,571 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-08 22:01:55,572 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {637#true} {637#true} #59#return; {637#true} is VALID [2020-07-08 22:01:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:01:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:01:55,709 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} ~n := #in~n; {676#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 22:01:55,710 INFO L280 TraceCheckUtils]: 1: Hoare triple {676#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 22:01:55,710 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#(<= |fibo2_#in~n| 0)} #res := 0; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 22:01:55,711 INFO L280 TraceCheckUtils]: 3: Hoare triple {677#(<= |fibo2_#in~n| 0)} assume true; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 22:01:55,712 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {677#(<= |fibo2_#in~n| 0)} {665#(< 1 fibo1_~n)} #69#return; {638#false} is VALID [2020-07-08 22:01:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:01:55,726 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-08 22:01:55,726 INFO L280 TraceCheckUtils]: 1: Hoare triple {637#true} assume ~n < 1; {637#true} is VALID [2020-07-08 22:01:55,727 INFO L280 TraceCheckUtils]: 2: Hoare triple {637#true} #res := 0; {637#true} is VALID [2020-07-08 22:01:55,727 INFO L280 TraceCheckUtils]: 3: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-08 22:01:55,727 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {637#true} {638#false} #71#return; {638#false} is VALID [2020-07-08 22:01:55,728 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-08 22:01:55,728 INFO L280 TraceCheckUtils]: 1: Hoare triple {637#true} assume !(~n < 1); {664#(< 0 fibo1_~n)} is VALID [2020-07-08 22:01:55,730 INFO L280 TraceCheckUtils]: 2: Hoare triple {664#(< 0 fibo1_~n)} assume !(1 == ~n); {665#(< 1 fibo1_~n)} is VALID [2020-07-08 22:01:55,730 INFO L263 TraceCheckUtils]: 3: Hoare triple {665#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {637#true} is VALID [2020-07-08 22:01:55,731 INFO L280 TraceCheckUtils]: 4: Hoare triple {637#true} ~n := #in~n; {676#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 22:01:55,731 INFO L280 TraceCheckUtils]: 5: Hoare triple {676#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 22:01:55,732 INFO L280 TraceCheckUtils]: 6: Hoare triple {677#(<= |fibo2_#in~n| 0)} #res := 0; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 22:01:55,733 INFO L280 TraceCheckUtils]: 7: Hoare triple {677#(<= |fibo2_#in~n| 0)} assume true; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 22:01:55,734 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {677#(<= |fibo2_#in~n| 0)} {665#(< 1 fibo1_~n)} #69#return; {638#false} is VALID [2020-07-08 22:01:55,734 INFO L280 TraceCheckUtils]: 9: Hoare triple {638#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {638#false} is VALID [2020-07-08 22:01:55,734 INFO L263 TraceCheckUtils]: 10: Hoare triple {638#false} call #t~ret1 := fibo2(~n - 2); {637#true} is VALID [2020-07-08 22:01:55,735 INFO L280 TraceCheckUtils]: 11: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-08 22:01:55,735 INFO L280 TraceCheckUtils]: 12: Hoare triple {637#true} assume ~n < 1; {637#true} is VALID [2020-07-08 22:01:55,735 INFO L280 TraceCheckUtils]: 13: Hoare triple {637#true} #res := 0; {637#true} is VALID [2020-07-08 22:01:55,736 INFO L280 TraceCheckUtils]: 14: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-08 22:01:55,737 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {637#true} {638#false} #71#return; {638#false} is VALID [2020-07-08 22:01:55,737 INFO L280 TraceCheckUtils]: 16: Hoare triple {638#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {638#false} is VALID [2020-07-08 22:01:55,737 INFO L280 TraceCheckUtils]: 17: Hoare triple {638#false} #res := #t~ret0 + #t~ret1; {638#false} is VALID [2020-07-08 22:01:55,737 INFO L280 TraceCheckUtils]: 18: Hoare triple {638#false} havoc #t~ret1; {638#false} is VALID [2020-07-08 22:01:55,738 INFO L280 TraceCheckUtils]: 19: Hoare triple {638#false} havoc #t~ret0; {638#false} is VALID [2020-07-08 22:01:55,738 INFO L280 TraceCheckUtils]: 20: Hoare triple {638#false} assume true; {638#false} is VALID [2020-07-08 22:01:55,738 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {638#false} {641#(<= 2 main_~x~0)} #63#return; {638#false} is VALID [2020-07-08 22:01:55,742 INFO L263 TraceCheckUtils]: 0: Hoare triple {637#true} call ULTIMATE.init(); {637#true} is VALID [2020-07-08 22:01:55,742 INFO L280 TraceCheckUtils]: 1: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-08 22:01:55,743 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {637#true} {637#true} #59#return; {637#true} is VALID [2020-07-08 22:01:55,743 INFO L263 TraceCheckUtils]: 3: Hoare triple {637#true} call #t~ret5 := main(); {637#true} is VALID [2020-07-08 22:01:55,749 INFO L280 TraceCheckUtils]: 4: Hoare triple {637#true} ~x~0 := 2; {641#(<= 2 main_~x~0)} is VALID [2020-07-08 22:01:55,749 INFO L263 TraceCheckUtils]: 5: Hoare triple {641#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {637#true} is VALID [2020-07-08 22:01:55,749 INFO L280 TraceCheckUtils]: 6: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-08 22:01:55,750 INFO L280 TraceCheckUtils]: 7: Hoare triple {637#true} assume !(~n < 1); {664#(< 0 fibo1_~n)} is VALID [2020-07-08 22:01:55,751 INFO L280 TraceCheckUtils]: 8: Hoare triple {664#(< 0 fibo1_~n)} assume !(1 == ~n); {665#(< 1 fibo1_~n)} is VALID [2020-07-08 22:01:55,751 INFO L263 TraceCheckUtils]: 9: Hoare triple {665#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {637#true} is VALID [2020-07-08 22:01:55,752 INFO L280 TraceCheckUtils]: 10: Hoare triple {637#true} ~n := #in~n; {676#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 22:01:55,753 INFO L280 TraceCheckUtils]: 11: Hoare triple {676#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 22:01:55,753 INFO L280 TraceCheckUtils]: 12: Hoare triple {677#(<= |fibo2_#in~n| 0)} #res := 0; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 22:01:55,754 INFO L280 TraceCheckUtils]: 13: Hoare triple {677#(<= |fibo2_#in~n| 0)} assume true; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 22:01:55,755 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {677#(<= |fibo2_#in~n| 0)} {665#(< 1 fibo1_~n)} #69#return; {638#false} is VALID [2020-07-08 22:01:55,756 INFO L280 TraceCheckUtils]: 15: Hoare triple {638#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {638#false} is VALID [2020-07-08 22:01:55,756 INFO L263 TraceCheckUtils]: 16: Hoare triple {638#false} call #t~ret1 := fibo2(~n - 2); {637#true} is VALID [2020-07-08 22:01:55,756 INFO L280 TraceCheckUtils]: 17: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-08 22:01:55,756 INFO L280 TraceCheckUtils]: 18: Hoare triple {637#true} assume ~n < 1; {637#true} is VALID [2020-07-08 22:01:55,757 INFO L280 TraceCheckUtils]: 19: Hoare triple {637#true} #res := 0; {637#true} is VALID [2020-07-08 22:01:55,757 INFO L280 TraceCheckUtils]: 20: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-08 22:01:55,757 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {637#true} {638#false} #71#return; {638#false} is VALID [2020-07-08 22:01:55,758 INFO L280 TraceCheckUtils]: 22: Hoare triple {638#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {638#false} is VALID [2020-07-08 22:01:55,758 INFO L280 TraceCheckUtils]: 23: Hoare triple {638#false} #res := #t~ret0 + #t~ret1; {638#false} is VALID [2020-07-08 22:01:55,758 INFO L280 TraceCheckUtils]: 24: Hoare triple {638#false} havoc #t~ret1; {638#false} is VALID [2020-07-08 22:01:55,758 INFO L280 TraceCheckUtils]: 25: Hoare triple {638#false} havoc #t~ret0; {638#false} is VALID [2020-07-08 22:01:55,759 INFO L280 TraceCheckUtils]: 26: Hoare triple {638#false} assume true; {638#false} is VALID [2020-07-08 22:01:55,759 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {638#false} {641#(<= 2 main_~x~0)} #63#return; {638#false} is VALID [2020-07-08 22:01:55,759 INFO L280 TraceCheckUtils]: 28: Hoare triple {638#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {638#false} is VALID [2020-07-08 22:01:55,760 INFO L280 TraceCheckUtils]: 29: Hoare triple {638#false} ~result~0 := #t~ret4; {638#false} is VALID [2020-07-08 22:01:55,760 INFO L280 TraceCheckUtils]: 30: Hoare triple {638#false} havoc #t~ret4; {638#false} is VALID [2020-07-08 22:01:55,760 INFO L280 TraceCheckUtils]: 31: Hoare triple {638#false} assume 1 == ~result~0; {638#false} is VALID [2020-07-08 22:01:55,760 INFO L280 TraceCheckUtils]: 32: Hoare triple {638#false} assume !false; {638#false} is VALID [2020-07-08 22:01:55,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 22:01:55,762 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [866692669] [2020-07-08 22:01:55,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:01:55,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-08 22:01:55,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731545039] [2020-07-08 22:01:55,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-08 22:01:55,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:01:55,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 22:01:55,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:01:55,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 22:01:55,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:01:55,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 22:01:55,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-08 22:01:55,804 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-07-08 22:01:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:01:56,189 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-07-08 22:01:56,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 22:01:56,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-08 22:01:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:01:56,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 22:01:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2020-07-08 22:01:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 22:01:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2020-07-08 22:01:56,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2020-07-08 22:01:56,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:01:56,339 INFO L225 Difference]: With dead ends: 82 [2020-07-08 22:01:56,339 INFO L226 Difference]: Without dead ends: 46 [2020-07-08 22:01:56,340 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-08 22:01:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-08 22:01:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-07-08 22:01:56,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:01:56,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2020-07-08 22:01:56,388 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2020-07-08 22:01:56,388 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2020-07-08 22:01:56,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:01:56,392 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-07-08 22:01:56,392 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-08 22:01:56,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:01:56,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:01:56,393 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2020-07-08 22:01:56,394 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2020-07-08 22:01:56,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:01:56,397 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-07-08 22:01:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-08 22:01:56,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:01:56,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:01:56,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:01:56,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:01:56,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-08 22:01:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-07-08 22:01:56,402 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-07-08 22:01:56,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:01:56,402 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-07-08 22:01:56,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 22:01:56,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2020-07-08 22:01:56,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:01:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-07-08 22:01:56,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-08 22:01:56,478 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:01:56,478 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:01:56,478 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 22:01:56,478 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:01:56,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:01:56,488 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-07-08 22:01:56,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:01:56,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2043094005] [2020-07-08 22:01:56,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:01:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 22:01:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 22:01:56,567 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 22:01:56,567 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 22:01:56,568 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 22:01:56,595 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 22:01:56,595 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 22:01:56,596 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 22:01:56,596 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 22:01:56,596 WARN L170 areAnnotationChecker]: fibo2ENTRY has no Hoare annotation [2020-07-08 22:01:56,596 WARN L170 areAnnotationChecker]: fibo1ENTRY has no Hoare annotation [2020-07-08 22:01:56,596 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 22:01:56,596 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 22:01:56,596 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 22:01:56,597 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 22:01:56,597 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 22:01:56,597 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 22:01:56,597 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 22:01:56,597 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 22:01:56,597 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 22:01:56,598 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 22:01:56,598 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-08 22:01:56,598 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-08 22:01:56,598 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-08 22:01:56,598 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-08 22:01:56,598 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-08 22:01:56,598 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-08 22:01:56,598 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-08 22:01:56,599 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-08 22:01:56,599 WARN L170 areAnnotationChecker]: fibo2FINAL has no Hoare annotation [2020-07-08 22:01:56,599 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 22:01:56,599 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 22:01:56,599 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 22:01:56,599 WARN L170 areAnnotationChecker]: fibo1FINAL has no Hoare annotation [2020-07-08 22:01:56,599 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 22:01:56,599 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 22:01:56,600 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 22:01:56,600 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-08 22:01:56,600 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-08 22:01:56,600 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-08 22:01:56,600 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 22:01:56,600 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-08 22:01:56,600 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-08 22:01:56,600 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-08 22:01:56,601 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 22:01:56,601 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-08 22:01:56,601 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-08 22:01:56,601 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 22:01:56,601 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-08 22:01:56,601 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-08 22:01:56,601 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-08 22:01:56,601 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-08 22:01:56,602 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-08 22:01:56,602 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-08 22:01:56,602 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-08 22:01:56,602 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-08 22:01:56,602 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-08 22:01:56,602 WARN L170 areAnnotationChecker]: L23-4 has no Hoare annotation [2020-07-08 22:01:56,602 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 22:01:56,602 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2020-07-08 22:01:56,603 WARN L170 areAnnotationChecker]: L23-5 has no Hoare annotation [2020-07-08 22:01:56,603 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 22:01:56,603 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-08 22:01:56,603 WARN L170 areAnnotationChecker]: L23-6 has no Hoare annotation [2020-07-08 22:01:56,603 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 22:01:56,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 10:01:56 BoogieIcfgContainer [2020-07-08 22:01:56,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 22:01:56,609 INFO L168 Benchmark]: Toolchain (without parser) took 4052.29 ms. Allocated memory was 144.7 MB in the beginning and 246.9 MB in the end (delta: 102.2 MB). Free memory was 103.1 MB in the beginning and 215.2 MB in the end (delta: -112.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 22:01:56,610 INFO L168 Benchmark]: CDTParser took 1.30 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 22:01:56,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.82 ms. Allocated memory is still 144.7 MB. Free memory was 102.9 MB in the beginning and 93.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-08 22:01:56,612 INFO L168 Benchmark]: Boogie Preprocessor took 30.58 ms. Allocated memory is still 144.7 MB. Free memory was 93.1 MB in the beginning and 91.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-08 22:01:56,613 INFO L168 Benchmark]: RCFGBuilder took 512.56 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 91.6 MB in the beginning and 161.1 MB in the end (delta: -69.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-08 22:01:56,614 INFO L168 Benchmark]: TraceAbstraction took 3252.10 ms. Allocated memory was 202.9 MB in the beginning and 246.9 MB in the end (delta: 44.0 MB). Free memory was 161.1 MB in the beginning and 215.2 MB in the end (delta: -54.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 22:01:56,617 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.30 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 251.82 ms. Allocated memory is still 144.7 MB. Free memory was 102.9 MB in the beginning and 93.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.58 ms. Allocated memory is still 144.7 MB. Free memory was 93.1 MB in the beginning and 91.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 512.56 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 91.6 MB in the beginning and 161.1 MB in the end (delta: -69.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3252.10 ms. Allocated memory was 202.9 MB in the beginning and 246.9 MB in the end (delta: 44.0 MB). Free memory was 161.1 MB in the beginning and 215.2 MB in the end (delta: -54.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 2; VAL [x=2] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=2, \result=1, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=1, x=2] [L37] int result = fibo1(x); VAL [fibo1(x)=1, result=1, x=2] [L38] COND TRUE result == 1 VAL [result=1, x=2] [L39] __VERIFIER_error() VAL [result=1, x=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.1s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 126 SDtfs, 72 SDslu, 322 SDs, 0 SdLazy, 106 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 2295 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...