/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:39:35,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:39:35,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:39:35,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:39:35,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:39:35,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:39:35,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:39:35,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:39:35,478 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:39:35,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:39:35,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:39:35,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:39:35,484 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:39:35,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:39:35,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:39:35,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:39:35,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:39:35,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:39:35,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:39:35,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:39:35,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:39:35,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:39:35,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:39:35,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:39:35,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:39:35,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:39:35,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:39:35,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:39:35,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:39:35,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:39:35,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:39:35,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:39:35,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:39:35,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:39:35,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:39:35,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:39:35,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:39:35,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:39:35,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:39:35,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:39:35,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:39:35,542 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:39:35,556 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:39:35,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:39:35,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:39:35,558 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:39:35,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:39:35,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:39:35,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:39:35,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:39:35,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:39:35,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:39:35,561 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:39:35,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:39:35,561 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:39:35,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:39:35,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:39:35,562 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:39:35,562 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:39:35,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:39:35,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:39:35,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:39:35,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:39:35,563 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:39:35,564 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 21:39:36,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:39:36,061 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:39:36,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:39:36,069 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:39:36,070 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:39:36,071 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-09-04 21:39:36,153 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d805c5db2/2c64922e5c464de28f3b2a0fdff5f088/FLAGda74cc0c1 [2020-09-04 21:39:36,635 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:39:36,636 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-09-04 21:39:36,645 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d805c5db2/2c64922e5c464de28f3b2a0fdff5f088/FLAGda74cc0c1 [2020-09-04 21:39:36,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d805c5db2/2c64922e5c464de28f3b2a0fdff5f088 [2020-09-04 21:39:36,989 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:39:36,991 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:39:36,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:39:36,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:39:37,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:39:37,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:39:36" (1/1) ... [2020-09-04 21:39:37,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51d7e22e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:39:37, skipping insertion in model container [2020-09-04 21:39:37,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:39:36" (1/1) ... [2020-09-04 21:39:37,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:39:37,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:39:37,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:39:37,253 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:39:37,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:39:37,290 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:39:37,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:39:37 WrapperNode [2020-09-04 21:39:37,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:39:37,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:39:37,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:39:37,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:39:37,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:39:37" (1/1) ... [2020-09-04 21:39:37,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:39:37" (1/1) ... [2020-09-04 21:39:37,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:39:37" (1/1) ... [2020-09-04 21:39:37,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:39:37" (1/1) ... [2020-09-04 21:39:37,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:39:37" (1/1) ... [2020-09-04 21:39:37,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:39:37" (1/1) ... [2020-09-04 21:39:37,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:39:37" (1/1) ... [2020-09-04 21:39:37,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:39:37,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:39:37,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:39:37,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:39:37,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:39:37" (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 21:39:37,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:39:37,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:39:37,484 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-09-04 21:39:37,484 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:39:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:39:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:39:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-09-04 21:39:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:39:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:39:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:39:37,683 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:39:37,683 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:39:37,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:39:37 BoogieIcfgContainer [2020-09-04 21:39:37,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:39:37,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:39:37,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:39:37,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:39:37,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:39:36" (1/3) ... [2020-09-04 21:39:37,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46862b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:39:37, skipping insertion in model container [2020-09-04 21:39:37,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:39:37" (2/3) ... [2020-09-04 21:39:37,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46862b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:39:37, skipping insertion in model container [2020-09-04 21:39:37,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:39:37" (3/3) ... [2020-09-04 21:39:37,698 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-09-04 21:39:37,711 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:39:37,721 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:39:37,749 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:39:37,781 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:39:37,781 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:39:37,781 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:39:37,781 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:39:37,782 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:39:37,782 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:39:37,782 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:39:37,782 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:39:37,804 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-09-04 21:39:37,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 21:39:37,819 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:39:37,821 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:39:37,821 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:39:37,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:39:37,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1756383024, now seen corresponding path program 1 times [2020-09-04 21:39:37,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:39:37,843 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2089560633] [2020-09-04 21:39:37,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:39:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:38,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:39:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:38,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:39:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:38,067 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 21:39:38,068 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2089560633] [2020-09-04 21:39:38,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:39:38,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:39:38,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943666844] [2020-09-04 21:39:38,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:39:38,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:39:38,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:39:38,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:39:38,096 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2020-09-04 21:39:38,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:39:38,226 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-09-04 21:39:38,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:39:38,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 21:39:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:39:38,240 INFO L225 Difference]: With dead ends: 44 [2020-09-04 21:39:38,240 INFO L226 Difference]: Without dead ends: 28 [2020-09-04 21:39:38,244 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 21:39:38,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-09-04 21:39:38,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-09-04 21:39:38,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 21:39:38,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-09-04 21:39:38,298 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2020-09-04 21:39:38,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:39:38,299 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-09-04 21:39:38,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:39:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-09-04 21:39:38,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-04 21:39:38,301 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:39:38,302 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:39:38,302 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:39:38,302 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:39:38,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:39:38,303 INFO L82 PathProgramCache]: Analyzing trace with hash -389703589, now seen corresponding path program 1 times [2020-09-04 21:39:38,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:39:38,304 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1773125798] [2020-09-04 21:39:38,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:39:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:38,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:39:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:38,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:39:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:38,384 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 21:39:38,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1773125798] [2020-09-04 21:39:38,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:39:38,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:39:38,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582460969] [2020-09-04 21:39:38,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:39:38,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:39:38,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:39:38,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:39:38,389 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2020-09-04 21:39:38,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:39:38,460 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-09-04 21:39:38,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:39:38,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-04 21:39:38,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:39:38,463 INFO L225 Difference]: With dead ends: 36 [2020-09-04 21:39:38,463 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 21:39:38,464 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 21:39:38,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 21:39:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-09-04 21:39:38,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 21:39:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-09-04 21:39:38,490 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2020-09-04 21:39:38,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:39:38,491 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-09-04 21:39:38,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:39:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-09-04 21:39:38,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 21:39:38,495 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:39:38,496 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:39:38,496 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:39:38,496 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:39:38,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:39:38,497 INFO L82 PathProgramCache]: Analyzing trace with hash 50309368, now seen corresponding path program 1 times [2020-09-04 21:39:38,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:39:38,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2039738373] [2020-09-04 21:39:38,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:39:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:38,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:39:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:38,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:39:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:38,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:38,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:39:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:38,718 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 21:39:38,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2039738373] [2020-09-04 21:39:38,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:39:38,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:39:38,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463720090] [2020-09-04 21:39:38,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:39:38,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:39:38,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:39:38,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:39:38,723 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2020-09-04 21:39:38,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:39:38,839 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2020-09-04 21:39:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:39:38,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-09-04 21:39:38,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:39:38,842 INFO L225 Difference]: With dead ends: 52 [2020-09-04 21:39:38,842 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 21:39:38,843 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:39:38,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 21:39:38,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-04 21:39:38,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 21:39:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-09-04 21:39:38,855 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 33 [2020-09-04 21:39:38,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:39:38,856 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-09-04 21:39:38,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:39:38,856 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-09-04 21:39:38,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 21:39:38,858 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:39:38,858 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, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:39:38,858 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:39:38,859 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:39:38,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:39:38,859 INFO L82 PathProgramCache]: Analyzing trace with hash -643371531, now seen corresponding path program 1 times [2020-09-04 21:39:38,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:39:38,860 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1203373448] [2020-09-04 21:39:38,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:39:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:38,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:39:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:38,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:39:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:38,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:38,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:38,972 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 21:39:38,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1203373448] [2020-09-04 21:39:38,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:39:38,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:39:38,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069997645] [2020-09-04 21:39:38,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:39:38,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:39:38,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:39:38,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:39:38,975 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-09-04 21:39:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:39:39,099 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2020-09-04 21:39:39,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:39:39,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-09-04 21:39:39,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:39:39,103 INFO L225 Difference]: With dead ends: 56 [2020-09-04 21:39:39,103 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 21:39:39,104 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:39:39,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 21:39:39,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-09-04 21:39:39,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 21:39:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2020-09-04 21:39:39,121 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2020-09-04 21:39:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:39:39,121 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-09-04 21:39:39,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:39:39,122 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-09-04 21:39:39,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 21:39:39,124 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:39:39,124 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:39:39,125 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:39:39,125 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:39:39,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:39:39,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1274787059, now seen corresponding path program 2 times [2020-09-04 21:39:39,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:39:39,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1640259837] [2020-09-04 21:39:39,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:39:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:39,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:39:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:39,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:39:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:39,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:39,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:39,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:39,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-09-04 21:39:39,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1640259837] [2020-09-04 21:39:39,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:39:39,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:39:39,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129912750] [2020-09-04 21:39:39,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:39:39,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:39:39,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:39:39,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:39:39,344 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 8 states. [2020-09-04 21:39:39,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:39:39,484 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2020-09-04 21:39:39,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:39:39,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-09-04 21:39:39,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:39:39,487 INFO L225 Difference]: With dead ends: 111 [2020-09-04 21:39:39,487 INFO L226 Difference]: Without dead ends: 67 [2020-09-04 21:39:39,489 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:39:39,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-09-04 21:39:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2020-09-04 21:39:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-09-04 21:39:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2020-09-04 21:39:39,505 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 51 [2020-09-04 21:39:39,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:39:39,506 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-09-04 21:39:39,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:39:39,506 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2020-09-04 21:39:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 21:39:39,509 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:39:39,509 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:39:39,510 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:39:39,510 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:39:39,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:39:39,510 INFO L82 PathProgramCache]: Analyzing trace with hash 99184320, now seen corresponding path program 3 times [2020-09-04 21:39:39,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:39:39,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [466120346] [2020-09-04 21:39:39,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:39:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:39,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:39:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:39,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:39:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:39,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:39,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:39,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:39,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:39,631 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-09-04 21:39:39,631 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [466120346] [2020-09-04 21:39:39,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:39:39,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:39:39,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463390963] [2020-09-04 21:39:39,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:39:39,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:39:39,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:39:39,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:39:39,634 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand 7 states. [2020-09-04 21:39:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:39:39,753 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2020-09-04 21:39:39,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:39:39,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2020-09-04 21:39:39,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:39:39,757 INFO L225 Difference]: With dead ends: 89 [2020-09-04 21:39:39,757 INFO L226 Difference]: Without dead ends: 83 [2020-09-04 21:39:39,758 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:39:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-09-04 21:39:39,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2020-09-04 21:39:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-09-04 21:39:39,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2020-09-04 21:39:39,779 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 52 [2020-09-04 21:39:39,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:39:39,780 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2020-09-04 21:39:39,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:39:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2020-09-04 21:39:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 21:39:39,785 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:39:39,786 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:39:39,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:39:39,786 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:39:39,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:39:39,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1883941443, now seen corresponding path program 4 times [2020-09-04 21:39:39,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:39:39,789 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1774638216] [2020-09-04 21:39:39,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:39:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:39,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:39:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:39,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:39:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:39,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:39,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:39,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,183 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 130 proven. 176 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-09-04 21:39:40,183 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1774638216] [2020-09-04 21:39:40,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:39:40,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:39:40,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365526332] [2020-09-04 21:39:40,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:39:40,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:39:40,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:39:40,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:39:40,188 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand 11 states. [2020-09-04 21:39:40,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:39:40,552 INFO L93 Difference]: Finished difference Result 142 states and 213 transitions. [2020-09-04 21:39:40,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:39:40,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2020-09-04 21:39:40,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:39:40,559 INFO L225 Difference]: With dead ends: 142 [2020-09-04 21:39:40,560 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 21:39:40,564 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2020-09-04 21:39:40,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 21:39:40,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2020-09-04 21:39:40,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 21:39:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2020-09-04 21:39:40,590 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 123 [2020-09-04 21:39:40,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:39:40,591 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2020-09-04 21:39:40,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:39:40,592 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2020-09-04 21:39:40,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-09-04 21:39:40,599 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:39:40,600 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:39:40,600 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:39:40,600 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:39:40,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:39:40,600 INFO L82 PathProgramCache]: Analyzing trace with hash 532445701, now seen corresponding path program 5 times [2020-09-04 21:39:40,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:39:40,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1438468899] [2020-09-04 21:39:40,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:39:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:39:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:39:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:40,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:41,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:41,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:41,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:41,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:41,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:41,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:41,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:41,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:41,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:41,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 375 proven. 413 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2020-09-04 21:39:41,193 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1438468899] [2020-09-04 21:39:41,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:39:41,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:39:41,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032280424] [2020-09-04 21:39:41,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:39:41,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:39:41,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:39:41,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:39:41,196 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 13 states. [2020-09-04 21:39:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:39:41,684 INFO L93 Difference]: Finished difference Result 149 states and 204 transitions. [2020-09-04 21:39:41,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 21:39:41,684 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 193 [2020-09-04 21:39:41,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:39:41,687 INFO L225 Difference]: With dead ends: 149 [2020-09-04 21:39:41,687 INFO L226 Difference]: Without dead ends: 92 [2020-09-04 21:39:41,689 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2020-09-04 21:39:41,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-09-04 21:39:41,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2020-09-04 21:39:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-09-04 21:39:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2020-09-04 21:39:41,707 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 193 [2020-09-04 21:39:41,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:39:41,708 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2020-09-04 21:39:41,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:39:41,708 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2020-09-04 21:39:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2020-09-04 21:39:41,713 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:39:41,713 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 10, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:39:41,713 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:39:41,714 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:39:41,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:39:41,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2080077336, now seen corresponding path program 6 times [2020-09-04 21:39:41,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:39:41,715 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [996468487] [2020-09-04 21:39:41,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:39:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:41,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:39:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:41,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:39:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:41,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:41,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:39:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2955 backedges. 552 proven. 920 refuted. 0 times theorem prover too weak. 1483 trivial. 0 not checked. [2020-09-04 21:39:42,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [996468487] [2020-09-04 21:39:42,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:39:42,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:39:42,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150197281] [2020-09-04 21:39:42,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:39:42,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:39:42,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:39:42,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:39:42,518 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand 15 states. [2020-09-04 21:39:43,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:39:43,171 INFO L93 Difference]: Finished difference Result 194 states and 284 transitions. [2020-09-04 21:39:43,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-09-04 21:39:43,171 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 281 [2020-09-04 21:39:43,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:39:43,175 INFO L225 Difference]: With dead ends: 194 [2020-09-04 21:39:43,175 INFO L226 Difference]: Without dead ends: 119 [2020-09-04 21:39:43,177 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=877, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 21:39:43,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-09-04 21:39:43,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2020-09-04 21:39:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-09-04 21:39:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 138 transitions. [2020-09-04 21:39:43,216 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 138 transitions. Word has length 281 [2020-09-04 21:39:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:39:43,217 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 138 transitions. [2020-09-04 21:39:43,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:39:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 138 transitions. [2020-09-04 21:39:43,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2020-09-04 21:39:43,226 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:39:43,227 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:39:43,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:39:43,227 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:39:43,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:39:43,228 INFO L82 PathProgramCache]: Analyzing trace with hash 260846875, now seen corresponding path program 7 times [2020-09-04 21:39:43,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:39:43,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [735641904] [2020-09-04 21:39:43,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:39:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:39:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:39:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:39:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-09-04 21:39:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:43,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:44,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:44,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:44,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:44,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:44,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:44,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:44,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:44,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:44,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:44,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:44,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:44,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:44,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:44,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5244 backedges. 264 proven. 1364 refuted. 0 times theorem prover too weak. 3616 trivial. 0 not checked. [2020-09-04 21:39:44,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [735641904] [2020-09-04 21:39:44,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:39:44,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:39:44,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175455941] [2020-09-04 21:39:44,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:39:44,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:39:44,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:39:44,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:39:44,244 INFO L87 Difference]: Start difference. First operand 109 states and 138 transitions. Second operand 11 states. [2020-09-04 21:39:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:39:44,549 INFO L93 Difference]: Finished difference Result 356 states and 488 transitions. [2020-09-04 21:39:44,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 21:39:44,550 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 369 [2020-09-04 21:39:44,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:39:44,558 INFO L225 Difference]: With dead ends: 356 [2020-09-04 21:39:44,558 INFO L226 Difference]: Without dead ends: 350 [2020-09-04 21:39:44,559 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:39:44,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-09-04 21:39:44,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 320. [2020-09-04 21:39:44,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2020-09-04 21:39:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 441 transitions. [2020-09-04 21:39:44,618 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 441 transitions. Word has length 369 [2020-09-04 21:39:44,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:39:44,619 INFO L479 AbstractCegarLoop]: Abstraction has 320 states and 441 transitions. [2020-09-04 21:39:44,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:39:44,619 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 441 transitions. [2020-09-04 21:39:44,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2020-09-04 21:39:44,642 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:39:44,643 INFO L422 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 26, 26, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:39:44,643 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:39:44,643 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:39:44,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:39:44,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1826894978, now seen corresponding path program 8 times [2020-09-04 21:39:44,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:39:44,644 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1791925437] [2020-09-04 21:39:44,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:39:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:45,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:39:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:45,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:39:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:45,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:45,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:45,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:45,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:45,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:45,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:45,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:45,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:45,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:45,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:45,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:45,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:45,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:45,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:45,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:45,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:45,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:39:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-09-04 21:39:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2020-09-04 21:39:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:39:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-09-04 21:39:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:46,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:47,811 INFO L134 CoverageAnalysis]: Checked inductivity of 22008 backedges. 2418 proven. 4356 refuted. 0 times theorem prover too weak. 15234 trivial. 0 not checked. [2020-09-04 21:39:47,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1791925437] [2020-09-04 21:39:47,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:39:47,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-04 21:39:47,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714883738] [2020-09-04 21:39:47,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 21:39:47,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:39:47,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 21:39:47,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2020-09-04 21:39:47,815 INFO L87 Difference]: Start difference. First operand 320 states and 441 transitions. Second operand 19 states. [2020-09-04 21:39:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:39:48,802 INFO L93 Difference]: Finished difference Result 481 states and 761 transitions. [2020-09-04 21:39:48,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-09-04 21:39:48,802 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 739 [2020-09-04 21:39:48,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:39:48,806 INFO L225 Difference]: With dead ends: 481 [2020-09-04 21:39:48,806 INFO L226 Difference]: Without dead ends: 175 [2020-09-04 21:39:48,811 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=447, Invalid=1809, Unknown=0, NotChecked=0, Total=2256 [2020-09-04 21:39:48,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-09-04 21:39:48,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 149. [2020-09-04 21:39:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-09-04 21:39:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 201 transitions. [2020-09-04 21:39:48,830 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 201 transitions. Word has length 739 [2020-09-04 21:39:48,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:39:48,831 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 201 transitions. [2020-09-04 21:39:48,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 21:39:48,831 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 201 transitions. [2020-09-04 21:39:48,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 969 [2020-09-04 21:39:48,846 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:39:48,847 INFO L422 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 34, 34, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:39:48,847 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:39:48,848 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:39:48,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:39:48,848 INFO L82 PathProgramCache]: Analyzing trace with hash -668436832, now seen corresponding path program 9 times [2020-09-04 21:39:48,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:39:48,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [666957978] [2020-09-04 21:39:48,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:39:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:49,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:39:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:49,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:39:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:49,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:39:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-09-04 21:39:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2020-09-04 21:39:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:39:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:50,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 592 [2020-09-04 21:39:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:39:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-09-04 21:39:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:51,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 38160 backedges. 950 proven. 5310 refuted. 0 times theorem prover too weak. 31900 trivial. 0 not checked. [2020-09-04 21:39:52,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [666957978] [2020-09-04 21:39:52,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:39:52,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:39:52,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348913027] [2020-09-04 21:39:52,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:39:52,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:39:52,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:39:52,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:39:52,532 INFO L87 Difference]: Start difference. First operand 149 states and 201 transitions. Second operand 13 states. [2020-09-04 21:39:52,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:39:52,949 INFO L93 Difference]: Finished difference Result 624 states and 903 transitions. [2020-09-04 21:39:52,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 21:39:52,950 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 968 [2020-09-04 21:39:52,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:39:52,965 INFO L225 Difference]: With dead ends: 624 [2020-09-04 21:39:52,965 INFO L226 Difference]: Without dead ends: 618 [2020-09-04 21:39:52,967 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-09-04 21:39:52,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-09-04 21:39:53,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 576. [2020-09-04 21:39:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2020-09-04 21:39:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 833 transitions. [2020-09-04 21:39:53,059 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 833 transitions. Word has length 968 [2020-09-04 21:39:53,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:39:53,060 INFO L479 AbstractCegarLoop]: Abstraction has 576 states and 833 transitions. [2020-09-04 21:39:53,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:39:53,061 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 833 transitions. [2020-09-04 21:39:53,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1938 [2020-09-04 21:39:53,112 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:39:53,113 INFO L422 BasicCegarLoop]: trace histogram [219, 219, 177, 109, 109, 109, 109, 109, 109, 109, 109, 109, 109, 68, 68, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:39:53,113 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 21:39:53,113 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:39:53,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:39:53,114 INFO L82 PathProgramCache]: Analyzing trace with hash -108146952, now seen corresponding path program 10 times [2020-09-04 21:39:53,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:39:53,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [320835396] [2020-09-04 21:39:53,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:39:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:55,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:39:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:55,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:39:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:56,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:39:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-09-04 21:39:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2020-09-04 21:39:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:57,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:39:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 592 [2020-09-04 21:39:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:39:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-09-04 21:39:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:58,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 962 [2020-09-04 21:39:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:39:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:39:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:39:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:39:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:39:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:39:59,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:39:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-09-04 21:40:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:40:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:40:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:40:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:40:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:40:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:40:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:40:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2020-09-04 21:40:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:40:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:40:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:40:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:40:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:40:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:40:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:40:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:40:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:40:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:40:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:40:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:40:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 592 [2020-09-04 21:40:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:40:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:40:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:40:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:40:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:40:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:40:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:40:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:40:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:40:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:40:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:40:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:40:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-09-04 21:40:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:40:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:40:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:40:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:40:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:40:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:40:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:40:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:00,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:40:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:40:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 155401 backedges. 8774 proven. 16708 refuted. 0 times theorem prover too weak. 129919 trivial. 0 not checked. [2020-09-04 21:40:03,953 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [320835396] [2020-09-04 21:40:03,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:40:03,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-04 21:40:03,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404041123] [2020-09-04 21:40:03,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 21:40:03,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:40:03,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 21:40:03,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2020-09-04 21:40:03,957 INFO L87 Difference]: Start difference. First operand 576 states and 833 transitions. Second operand 23 states. [2020-09-04 21:40:05,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:40:05,484 INFO L93 Difference]: Finished difference Result 808 states and 1346 transitions. [2020-09-04 21:40:05,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-09-04 21:40:05,485 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1937 [2020-09-04 21:40:05,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:40:05,492 INFO L225 Difference]: With dead ends: 808 [2020-09-04 21:40:05,492 INFO L226 Difference]: Without dead ends: 246 [2020-09-04 21:40:05,499 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=684, Invalid=2976, Unknown=0, NotChecked=0, Total=3660 [2020-09-04 21:40:05,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-09-04 21:40:05,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 195. [2020-09-04 21:40:05,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-09-04 21:40:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 283 transitions. [2020-09-04 21:40:05,520 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 283 transitions. Word has length 1937 [2020-09-04 21:40:05,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:40:05,521 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 283 transitions. [2020-09-04 21:40:05,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 21:40:05,522 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 283 transitions. [2020-09-04 21:40:05,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1568 [2020-09-04 21:40:05,541 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:40:05,542 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 55, 55, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:40:05,542 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 21:40:05,542 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:40:05,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:40:05,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1218167635, now seen corresponding path program 11 times [2020-09-04 21:40:05,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:40:05,544 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1468811712] [2020-09-04 21:40:05,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:40:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:40:05,993 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:40:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:40:06,322 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:40:06,423 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 21:40:06,423 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 21:40:06,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 21:40:06,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:40:06 BoogieIcfgContainer [2020-09-04 21:40:06,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:40:06,609 INFO L168 Benchmark]: Toolchain (without parser) took 29617.57 ms. Allocated memory was 146.8 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 104.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 567.5 MB. Max. memory is 7.1 GB. [2020-09-04 21:40:06,610 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 146.8 MB. Free memory was 122.4 MB in the beginning and 122.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 21:40:06,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.40 ms. Allocated memory is still 146.8 MB. Free memory was 104.4 MB in the beginning and 94.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-09-04 21:40:06,611 INFO L168 Benchmark]: Boogie Preprocessor took 33.31 ms. Allocated memory is still 146.8 MB. Free memory was 94.6 MB in the beginning and 93.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:40:06,612 INFO L168 Benchmark]: RCFGBuilder took 363.12 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 93.3 MB in the beginning and 171.0 MB in the end (delta: -77.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-09-04 21:40:06,613 INFO L168 Benchmark]: TraceAbstraction took 28916.72 ms. Allocated memory was 203.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 170.3 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 576.1 MB. Max. memory is 7.1 GB. [2020-09-04 21:40:06,616 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.25 ms. Allocated memory is still 146.8 MB. Free memory was 122.4 MB in the beginning and 122.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 295.40 ms. Allocated memory is still 146.8 MB. Free memory was 104.4 MB in the beginning and 94.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.31 ms. Allocated memory is still 146.8 MB. Free memory was 94.6 MB in the beginning and 93.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 363.12 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 93.3 MB in the beginning and 171.0 MB in the end (delta: -77.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28916.72 ms. Allocated memory was 203.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 170.3 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 576.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; VAL [x=10] [L25] CALL, EXPR fibo(x) VAL [\old(n)=10] [L6] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L8] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L6] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L8] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=7, \result=13, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=8, \result=21, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=7, \result=13, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=9, \result=34, fibo(n-1)=21, fibo(n-2)=13, n=9] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=7, \result=13, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=8, \result=21, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=10, \result=55, fibo(n-1)=34, fibo(n-2)=21, n=10] [L25] RET, EXPR fibo(x) VAL [fibo(x)=55, x=10] [L25] int result = fibo(x); VAL [fibo(x)=55, result=55, x=10] [L26] COND TRUE result == 55 VAL [result=55, x=10] [L27] __VERIFIER_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 28.6s, OverallIterations: 14, TraceHistogramMax: 219, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 472 SDtfs, 1382 SDslu, 1560 SDs, 0 SdLazy, 2303 SolverSat, 833 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1390 GetRequests, 1131 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=576occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 189 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 6380 NumberOfCodeBlocks, 6380 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4800 ConstructedInterpolants, 0 QuantifiedInterpolants, 6773792 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 196408/225700 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...