/usr/bin/java -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:05:26,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:05:26,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:05:26,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:05:26,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:05:26,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:05:26,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:05:26,531 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:05:26,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:05:26,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:05:26,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:05:26,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:05:26,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:05:26,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:05:26,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:05:26,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:05:26,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:05:26,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:05:26,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:05:26,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:05:26,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:05:26,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:05:26,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:05:26,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:05:26,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:05:26,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:05:26,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:05:26,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:05:26,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:05:26,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:05:26,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:05:26,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:05:26,560 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:05:26,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:05:26,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:05:26,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:05:26,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:05:26,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:05:26,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:05:26,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:05:26,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:05:26,566 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:05:26,593 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:05:26,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:05:26,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:05:26,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:05:26,595 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:05:26,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:05:26,596 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:05:26,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:05:26,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:05:26,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:05:26,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:05:26,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:05:26,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:05:26,597 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:05:26,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:05:26,598 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:05:26,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:05:26,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:05:26,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:05:26,599 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:05:26,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:05:26,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:05:26,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:05:26,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:05:26,600 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:05:26,600 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:05:26,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:05:26,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:05:26,600 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:05:26,601 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:05:27,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:05:27,127 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:05:27,131 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:05:27,133 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:05:27,133 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:05:27,135 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-09-04 13:05:27,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d354bdba5/b93d1e1a9c34464b96d6708a2dcc2a10/FLAGa8b187b4f [2020-09-04 13:05:27,768 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:05:27,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-09-04 13:05:27,779 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d354bdba5/b93d1e1a9c34464b96d6708a2dcc2a10/FLAGa8b187b4f [2020-09-04 13:05:28,085 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d354bdba5/b93d1e1a9c34464b96d6708a2dcc2a10 [2020-09-04 13:05:28,103 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:05:28,106 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:05:28,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:05:28,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:05:28,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:05:28,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:05:28" (1/1) ... [2020-09-04 13:05:28,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb7919e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:05:28, skipping insertion in model container [2020-09-04 13:05:28,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:05:28" (1/1) ... [2020-09-04 13:05:28,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:05:28,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:05:28,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:05:28,363 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:05:28,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:05:28,402 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:05:28,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:05:28 WrapperNode [2020-09-04 13:05:28,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:05:28,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:05:28,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:05:28,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:05:28,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:05:28" (1/1) ... [2020-09-04 13:05:28,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:05:28" (1/1) ... [2020-09-04 13:05:28,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:05:28" (1/1) ... [2020-09-04 13:05:28,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:05:28" (1/1) ... [2020-09-04 13:05:28,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:05:28" (1/1) ... [2020-09-04 13:05:28,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:05:28" (1/1) ... [2020-09-04 13:05:28,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:05:28" (1/1) ... [2020-09-04 13:05:28,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:05:28,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:05:28,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:05:28,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:05:28,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:05:28" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:05:28,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:05:28,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:05:28,617 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-09-04 13:05:28,617 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:05:28,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:05:28,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:05:28,617 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-09-04 13:05:28,617 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:05:28,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:05:28,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:05:28,909 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:05:28,909 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 13:05:28,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:05:28 BoogieIcfgContainer [2020-09-04 13:05:28,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:05:28,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:05:28,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:05:28,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:05:28,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:05:28" (1/3) ... [2020-09-04 13:05:28,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cb2493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:05:28, skipping insertion in model container [2020-09-04 13:05:28,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:05:28" (2/3) ... [2020-09-04 13:05:28,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cb2493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:05:28, skipping insertion in model container [2020-09-04 13:05:28,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:05:28" (3/3) ... [2020-09-04 13:05:28,937 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-09-04 13:05:28,948 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:05:28,960 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:05:28,982 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:05:29,014 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:05:29,015 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:05:29,015 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:05:29,015 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:05:29,017 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:05:29,017 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:05:29,017 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:05:29,017 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:05:29,039 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-09-04 13:05:29,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-04 13:05:29,047 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:05:29,048 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:05:29,049 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:05:29,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:05:29,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-09-04 13:05:29,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:05:29,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158531139] [2020-09-04 13:05:29,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:05:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:29,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:05:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:29,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:05:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:05:29,348 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158531139] [2020-09-04 13:05:29,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:05:29,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:05:29,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317890290] [2020-09-04 13:05:29,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:05:29,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:05:29,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:05:29,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:05:29,374 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-09-04 13:05:29,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:05:29,500 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-09-04 13:05:29,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:05:29,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-04 13:05:29,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:05:29,514 INFO L225 Difference]: With dead ends: 35 [2020-09-04 13:05:29,514 INFO L226 Difference]: Without dead ends: 21 [2020-09-04 13:05:29,519 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-09-04 13:05:29,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-09-04 13:05:29,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-09-04 13:05:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-09-04 13:05:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-09-04 13:05:29,566 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-09-04 13:05:29,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:05:29,566 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-09-04 13:05:29,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:05:29,567 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-09-04 13:05:29,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-09-04 13:05:29,569 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:05:29,569 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:05:29,569 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:05:29,570 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:05:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:05:29,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-09-04 13:05:29,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:05:29,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028242237] [2020-09-04 13:05:29,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:05:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:29,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:05:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:29,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:05:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:05:29,651 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028242237] [2020-09-04 13:05:29,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:05:29,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:05:29,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898813133] [2020-09-04 13:05:29,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:05:29,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:05:29,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:05:29,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:05:29,661 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-09-04 13:05:29,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:05:29,735 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-09-04 13:05:29,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:05:29,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-09-04 13:05:29,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:05:29,737 INFO L225 Difference]: With dead ends: 27 [2020-09-04 13:05:29,738 INFO L226 Difference]: Without dead ends: 23 [2020-09-04 13:05:29,739 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-09-04 13:05:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-04 13:05:29,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-09-04 13:05:29,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-09-04 13:05:29,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-09-04 13:05:29,747 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-09-04 13:05:29,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:05:29,748 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-09-04 13:05:29,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:05:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-09-04 13:05:29,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 13:05:29,750 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:05:29,750 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:05:29,750 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:05:29,751 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:05:29,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:05:29,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-09-04 13:05:29,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:05:29,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309923332] [2020-09-04 13:05:29,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:05:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:29,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:05:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:29,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:05:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:29,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:29,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-09-04 13:05:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 13:05:29,894 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309923332] [2020-09-04 13:05:29,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526566254] [2020-09-04 13:05:29,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:05:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:29,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-04 13:05:29,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:05:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 13:05:30,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:05:30,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-09-04 13:05:30,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611409600] [2020-09-04 13:05:30,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:05:30,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:05:30,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:05:30,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:05:30,120 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-09-04 13:05:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:05:30,254 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-09-04 13:05:30,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:05:30,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-09-04 13:05:30,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:05:30,257 INFO L225 Difference]: With dead ends: 38 [2020-09-04 13:05:30,257 INFO L226 Difference]: Without dead ends: 23 [2020-09-04 13:05:30,258 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:05:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-04 13:05:30,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-09-04 13:05:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-09-04 13:05:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-09-04 13:05:30,266 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-09-04 13:05:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:05:30,267 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-09-04 13:05:30,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:05:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-09-04 13:05:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 13:05:30,269 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:05:30,269 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:05:30,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-09-04 13:05:30,478 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:05:30,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:05:30,480 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-09-04 13:05:30,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:05:30,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331260604] [2020-09-04 13:05:30,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:05:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:30,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:05:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:30,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:05:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:30,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:30,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 13:05:30,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331260604] [2020-09-04 13:05:30,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627120086] [2020-09-04 13:05:30,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:05:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:30,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-04 13:05:30,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:05:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 13:05:30,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:05:30,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-09-04 13:05:30,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337044942] [2020-09-04 13:05:30,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 13:05:30,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:05:30,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 13:05:30,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:05:30,778 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 7 states. [2020-09-04 13:05:30,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:05:30,872 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-09-04 13:05:30,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:05:30,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-09-04 13:05:30,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:05:30,876 INFO L225 Difference]: With dead ends: 41 [2020-09-04 13:05:30,876 INFO L226 Difference]: Without dead ends: 37 [2020-09-04 13:05:30,877 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:05:30,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-09-04 13:05:30,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-09-04 13:05:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-09-04 13:05:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-09-04 13:05:30,888 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-09-04 13:05:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:05:30,889 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-09-04 13:05:30,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 13:05:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-09-04 13:05:30,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 13:05:30,891 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:05:30,892 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:05:31,106 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:05:31,106 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:05:31,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:05:31,107 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-09-04 13:05:31,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:05:31,108 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088885867] [2020-09-04 13:05:31,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:05:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:31,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:05:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:31,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:05:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:31,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:31,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:31,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:31,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-09-04 13:05:31,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088885867] [2020-09-04 13:05:31,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603485499] [2020-09-04 13:05:31,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:05:31,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-04 13:05:31,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:05:31,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-04 13:05:31,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:05:31,512 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-09-04 13:05:31,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:05:31,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-09-04 13:05:31,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832935010] [2020-09-04 13:05:31,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:05:31,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:05:31,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:05:31,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:05:31,516 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 12 states. [2020-09-04 13:05:31,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:05:31,781 INFO L93 Difference]: Finished difference Result 71 states and 106 transitions. [2020-09-04 13:05:31,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 13:05:31,782 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2020-09-04 13:05:31,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:05:31,783 INFO L225 Difference]: With dead ends: 71 [2020-09-04 13:05:31,784 INFO L226 Difference]: Without dead ends: 38 [2020-09-04 13:05:31,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-09-04 13:05:31,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-09-04 13:05:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-09-04 13:05:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-09-04 13:05:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-09-04 13:05:31,794 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 40 [2020-09-04 13:05:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:05:31,794 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-09-04 13:05:31,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:05:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-09-04 13:05:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-09-04 13:05:31,797 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:05:31,798 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:05:32,011 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:05:32,012 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:05:32,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:05:32,013 INFO L82 PathProgramCache]: Analyzing trace with hash -383842586, now seen corresponding path program 3 times [2020-09-04 13:05:32,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:05:32,014 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947858858] [2020-09-04 13:05:32,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:05:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:32,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:05:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:32,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:05:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:32,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:32,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:32,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:32,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:32,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:32,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:05:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:32,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:32,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-09-04 13:05:32,252 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947858858] [2020-09-04 13:05:32,252 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728629657] [2020-09-04 13:05:32,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:05:32,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-09-04 13:05:32,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:05:32,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-04 13:05:32,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:05:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-09-04 13:05:32,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:05:32,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2020-09-04 13:05:32,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623194873] [2020-09-04 13:05:32,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:05:32,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:05:32,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:05:32,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:05:32,422 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 10 states. [2020-09-04 13:05:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:05:32,617 INFO L93 Difference]: Finished difference Result 87 states and 126 transitions. [2020-09-04 13:05:32,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:05:32,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2020-09-04 13:05:32,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:05:32,622 INFO L225 Difference]: With dead ends: 87 [2020-09-04 13:05:32,622 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 13:05:32,625 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-09-04 13:05:32,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 13:05:32,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2020-09-04 13:05:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-04 13:05:32,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2020-09-04 13:05:32,651 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 68 [2020-09-04 13:05:32,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:05:32,653 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2020-09-04 13:05:32,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:05:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2020-09-04 13:05:32,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-09-04 13:05:32,661 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:05:32,661 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:05:32,875 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:05:32,875 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:05:32,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:05:32,876 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 4 times [2020-09-04 13:05:32,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:05:32,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694576271] [2020-09-04 13:05:32,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:05:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:32,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:05:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:32,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:05:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:33,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:33,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:33,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:33,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:33,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:33,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:33,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:05:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:33,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:33,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:33,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:05:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:33,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:33,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:33,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:33,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-09-04 13:05:33,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694576271] [2020-09-04 13:05:33,192 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62201912] [2020-09-04 13:05:33,192 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:05:33,258 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-09-04 13:05:33,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:05:33,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 12 conjunts are in the unsatisfiable core [2020-09-04 13:05:33,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:05:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-09-04 13:05:33,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:05:33,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-09-04 13:05:33,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162990079] [2020-09-04 13:05:33,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:05:33,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:05:33,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:05:33,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:05:33,324 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand 10 states. [2020-09-04 13:05:33,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:05:33,525 INFO L93 Difference]: Finished difference Result 117 states and 176 transitions. [2020-09-04 13:05:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:05:33,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 109 [2020-09-04 13:05:33,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:05:33,532 INFO L225 Difference]: With dead ends: 117 [2020-09-04 13:05:33,535 INFO L226 Difference]: Without dead ends: 113 [2020-09-04 13:05:33,536 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-09-04 13:05:33,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-09-04 13:05:33,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2020-09-04 13:05:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-09-04 13:05:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2020-09-04 13:05:33,574 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 109 [2020-09-04 13:05:33,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:05:33,576 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2020-09-04 13:05:33,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:05:33,577 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2020-09-04 13:05:33,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-09-04 13:05:33,587 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:05:33,587 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:05:33,794 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-09-04 13:05:33,795 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:05:33,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:05:33,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 5 times [2020-09-04 13:05:33,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:05:33,797 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469887045] [2020-09-04 13:05:33,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:05:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:33,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:05:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:33,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:05:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:33,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:05:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:05:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:05:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:05:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:34,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-09-04 13:05:34,337 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469887045] [2020-09-04 13:05:34,339 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383710434] [2020-09-04 13:05:34,339 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:05:34,451 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2020-09-04 13:05:34,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:05:34,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 10 conjunts are in the unsatisfiable core [2020-09-04 13:05:34,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:05:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2020-09-04 13:05:34,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:05:34,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2020-09-04 13:05:34,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215439152] [2020-09-04 13:05:34,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 13:05:34,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:05:34,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 13:05:34,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:05:34,614 INFO L87 Difference]: Start difference. First operand 104 states and 159 transitions. Second operand 11 states. [2020-09-04 13:05:34,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:05:34,869 INFO L93 Difference]: Finished difference Result 241 states and 406 transitions. [2020-09-04 13:05:34,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 13:05:34,871 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 177 [2020-09-04 13:05:34,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:05:34,882 INFO L225 Difference]: With dead ends: 241 [2020-09-04 13:05:34,882 INFO L226 Difference]: Without dead ends: 237 [2020-09-04 13:05:34,884 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2020-09-04 13:05:34,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-09-04 13:05:34,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 225. [2020-09-04 13:05:34,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2020-09-04 13:05:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 385 transitions. [2020-09-04 13:05:34,942 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 385 transitions. Word has length 177 [2020-09-04 13:05:34,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:05:34,943 INFO L479 AbstractCegarLoop]: Abstraction has 225 states and 385 transitions. [2020-09-04 13:05:34,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 13:05:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 385 transitions. [2020-09-04 13:05:34,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2020-09-04 13:05:34,949 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:05:34,950 INFO L422 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:05:35,159 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:05:35,159 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:05:35,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:05:35,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1242507885, now seen corresponding path program 6 times [2020-09-04 13:05:35,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:05:35,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004057816] [2020-09-04 13:05:35,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:05:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:05:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:05:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:05:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:05:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:05:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:35,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:05:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 13:05:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:05:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:05:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:05:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:05:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 921 proven. 1713 refuted. 0 times theorem prover too weak. 4486 trivial. 0 not checked. [2020-09-04 13:05:36,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004057816] [2020-09-04 13:05:36,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056728465] [2020-09-04 13:05:36,687 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:05:36,815 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2020-09-04 13:05:36,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:05:36,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 14 conjunts are in the unsatisfiable core [2020-09-04 13:05:36,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:05:37,060 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 356 proven. 1124 refuted. 0 times theorem prover too weak. 5640 trivial. 0 not checked. [2020-09-04 13:05:37,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:05:37,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 19 [2020-09-04 13:05:37,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675613158] [2020-09-04 13:05:37,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 13:05:37,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:05:37,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 13:05:37,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2020-09-04 13:05:37,066 INFO L87 Difference]: Start difference. First operand 225 states and 385 transitions. Second operand 19 states. [2020-09-04 13:05:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:05:37,916 INFO L93 Difference]: Finished difference Result 339 states and 657 transitions. [2020-09-04 13:05:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-09-04 13:05:37,916 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 354 [2020-09-04 13:05:37,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:05:37,919 INFO L225 Difference]: With dead ends: 339 [2020-09-04 13:05:37,919 INFO L226 Difference]: Without dead ends: 118 [2020-09-04 13:05:37,922 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=372, Invalid=1350, Unknown=0, NotChecked=0, Total=1722 [2020-09-04 13:05:37,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-09-04 13:05:37,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 96. [2020-09-04 13:05:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-09-04 13:05:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2020-09-04 13:05:37,933 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 354 [2020-09-04 13:05:37,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:05:37,934 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2020-09-04 13:05:37,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 13:05:37,935 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2020-09-04 13:05:37,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2020-09-04 13:05:37,948 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:05:37,948 INFO L422 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:05:38,168 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:05:38,169 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:05:38,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:05:38,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1052494023, now seen corresponding path program 7 times [2020-09-04 13:05:38,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:05:38,170 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436884123] [2020-09-04 13:05:38,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:05:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:38,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:05:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:38,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:05:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:38,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:38,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:05:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:05:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:05:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:05:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 13:05:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:05:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:05:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-09-04 13:05:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:05:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:05:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:39,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:05:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:05:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 13:05:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:05:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:05:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:05:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:05:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:05:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1851 proven. 3572 refuted. 0 times theorem prover too weak. 13680 trivial. 0 not checked. [2020-09-04 13:05:40,487 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436884123] [2020-09-04 13:05:40,487 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085943971] [2020-09-04 13:05:40,487 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:05:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:05:40,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 30 conjunts are in the unsatisfiable core [2020-09-04 13:05:40,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:05:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1969 proven. 3803 refuted. 0 times theorem prover too weak. 13331 trivial. 0 not checked. [2020-09-04 13:05:40,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:05:40,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 21 [2020-09-04 13:05:40,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514801023] [2020-09-04 13:05:40,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 13:05:40,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:05:40,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 13:05:40,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2020-09-04 13:05:40,964 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand 21 states. [2020-09-04 13:05:42,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:05:42,036 INFO L93 Difference]: Finished difference Result 220 states and 376 transitions. [2020-09-04 13:05:42,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-09-04 13:05:42,037 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 572 [2020-09-04 13:05:42,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:05:42,039 INFO L225 Difference]: With dead ends: 220 [2020-09-04 13:05:42,040 INFO L226 Difference]: Without dead ends: 130 [2020-09-04 13:05:42,042 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 786 GetRequests, 738 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=520, Invalid=1930, Unknown=0, NotChecked=0, Total=2450 [2020-09-04 13:05:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-09-04 13:05:42,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2020-09-04 13:05:42,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-09-04 13:05:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-09-04 13:05:42,056 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 572 [2020-09-04 13:05:42,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:05:42,057 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-09-04 13:05:42,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 13:05:42,057 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-09-04 13:05:42,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-09-04 13:05:42,060 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:05:42,060 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:05:42,274 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-09-04 13:05:42,274 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:05:42,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:05:42,275 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 8 times [2020-09-04 13:05:42,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:05:42,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967363564] [2020-09-04 13:05:42,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:05:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:05:42,422 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:05:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:05:42,550 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:05:42,614 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-04 13:05:42,615 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 13:05:42,615 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 13:05:42,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:05:42 BoogieIcfgContainer [2020-09-04 13:05:42,707 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:05:42,711 INFO L168 Benchmark]: Toolchain (without parser) took 14604.65 ms. Allocated memory was 140.5 MB in the beginning and 640.2 MB in the end (delta: 499.6 MB). Free memory was 101.9 MB in the beginning and 474.4 MB in the end (delta: -372.5 MB). Peak memory consumption was 127.1 MB. Max. memory is 7.1 GB. [2020-09-04 13:05:42,712 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 140.5 MB. Free memory was 120.2 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 13:05:42,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.14 ms. Allocated memory is still 140.5 MB. Free memory was 101.7 MB in the beginning and 92.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-09-04 13:05:42,714 INFO L168 Benchmark]: Boogie Preprocessor took 133.83 ms. Allocated memory was 140.5 MB in the beginning and 202.4 MB in the end (delta: 61.9 MB). Free memory was 92.3 MB in the beginning and 181.1 MB in the end (delta: -88.9 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-09-04 13:05:42,714 INFO L168 Benchmark]: RCFGBuilder took 382.33 ms. Allocated memory is still 202.4 MB. Free memory was 181.1 MB in the beginning and 168.9 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2020-09-04 13:05:42,715 INFO L168 Benchmark]: TraceAbstraction took 13785.94 ms. Allocated memory was 202.4 MB in the beginning and 640.2 MB in the end (delta: 437.8 MB). Free memory was 168.2 MB in the beginning and 474.4 MB in the end (delta: -306.2 MB). Peak memory consumption was 131.6 MB. Max. memory is 7.1 GB. [2020-09-04 13:05:42,719 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 140.5 MB. Free memory was 120.2 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 292.14 ms. Allocated memory is still 140.5 MB. Free memory was 101.7 MB in the beginning and 92.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.83 ms. Allocated memory was 140.5 MB in the beginning and 202.4 MB in the end (delta: 61.9 MB). Free memory was 92.3 MB in the beginning and 181.1 MB in the end (delta: -88.9 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 382.33 ms. Allocated memory is still 202.4 MB. Free memory was 181.1 MB in the beginning and 168.9 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13785.94 ms. Allocated memory was 202.4 MB in the beginning and 640.2 MB in the end (delta: 437.8 MB). Free memory was 168.2 MB in the beginning and 474.4 MB in the end (delta: -306.2 MB). Peak memory consumption was 131.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L31] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.6s, OverallIterations: 11, TraceHistogramMax: 83, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 224 SDtfs, 636 SDslu, 691 SDs, 0 SdLazy, 1378 SolverSat, 718 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1952 GetRequests, 1780 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 66 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 3236 NumberOfCodeBlocks, 3026 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 2755 ConstructedInterpolants, 0 QuantifiedInterpolants, 1392871 SizeOfPredicates, 47 NumberOfNonLiveVariables, 2614 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 45939/57416 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...