/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-72570d3 [2020-08-22 21:54:59,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 21:54:59,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 21:54:59,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 21:54:59,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 21:54:59,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 21:54:59,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 21:54:59,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 21:54:59,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 21:54:59,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 21:54:59,811 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 21:54:59,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 21:54:59,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 21:54:59,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 21:54:59,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 21:54:59,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 21:54:59,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 21:54:59,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 21:54:59,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 21:54:59,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 21:54:59,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 21:54:59,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 21:54:59,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 21:54:59,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 21:54:59,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 21:54:59,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 21:54:59,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 21:54:59,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 21:54:59,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 21:54:59,855 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 21:54:59,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 21:54:59,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 21:54:59,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 21:54:59,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 21:54:59,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 21:54:59,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 21:54:59,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 21:54:59,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 21:54:59,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 21:54:59,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 21:54:59,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 21:54:59,867 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 21:54:59,881 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 21:54:59,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 21:54:59,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 21:54:59,884 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 21:54:59,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 21:54:59,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 21:54:59,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 21:54:59,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 21:54:59,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 21:54:59,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 21:54:59,886 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 21:54:59,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 21:54:59,887 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 21:54:59,887 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 21:54:59,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 21:54:59,888 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 21:54:59,888 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 21:54:59,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 21:54:59,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 21:54:59,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 21:54:59,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 21:54:59,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 21:54:59,889 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-08-22 21:55:00,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 21:55:00,195 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 21:55:00,199 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 21:55:00,201 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 21:55:00,201 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 21:55:00,202 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-08-22 21:55:00,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7b818cc3/abad7a771130462d89751f44aa170af6/FLAGd264cb19a [2020-08-22 21:55:00,761 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 21:55:00,762 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-08-22 21:55:00,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7b818cc3/abad7a771130462d89751f44aa170af6/FLAGd264cb19a [2020-08-22 21:55:01,119 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7b818cc3/abad7a771130462d89751f44aa170af6 [2020-08-22 21:55:01,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 21:55:01,129 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 21:55:01,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 21:55:01,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 21:55:01,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 21:55:01,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 09:55:01" (1/1) ... [2020-08-22 21:55:01,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a430905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:55:01, skipping insertion in model container [2020-08-22 21:55:01,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 09:55:01" (1/1) ... [2020-08-22 21:55:01,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 21:55:01,165 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 21:55:01,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 21:55:01,332 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 21:55:01,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 21:55:01,358 INFO L208 MainTranslator]: Completed translation [2020-08-22 21:55:01,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:55:01 WrapperNode [2020-08-22 21:55:01,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 21:55:01,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 21:55:01,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 21:55:01,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 21:55:01,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:55:01" (1/1) ... [2020-08-22 21:55:01,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:55:01" (1/1) ... [2020-08-22 21:55:01,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:55:01" (1/1) ... [2020-08-22 21:55:01,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:55:01" (1/1) ... [2020-08-22 21:55:01,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:55:01" (1/1) ... [2020-08-22 21:55:01,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:55:01" (1/1) ... [2020-08-22 21:55:01,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:55:01" (1/1) ... [2020-08-22 21:55:01,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 21:55:01,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 21:55:01,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 21:55:01,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 21:55:01,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:55:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 21:55:01,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 21:55:01,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 21:55:01,543 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-08-22 21:55:01,543 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 21:55:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 21:55:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 21:55:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-08-22 21:55:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 21:55:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 21:55:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 21:55:01,726 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 21:55:01,727 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 21:55:01,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 09:55:01 BoogieIcfgContainer [2020-08-22 21:55:01,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 21:55:01,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 21:55:01,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 21:55:01,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 21:55:01,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 09:55:01" (1/3) ... [2020-08-22 21:55:01,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a4a73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 09:55:01, skipping insertion in model container [2020-08-22 21:55:01,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:55:01" (2/3) ... [2020-08-22 21:55:01,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a4a73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 09:55:01, skipping insertion in model container [2020-08-22 21:55:01,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 09:55:01" (3/3) ... [2020-08-22 21:55:01,740 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-08-22 21:55:01,754 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 21:55:01,762 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 21:55:01,780 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 21:55:01,839 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 21:55:01,840 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 21:55:01,840 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 21:55:01,840 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 21:55:01,840 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 21:55:01,840 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 21:55:01,844 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 21:55:01,844 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 21:55:01,869 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-08-22 21:55:01,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-08-22 21:55:01,880 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:55:01,880 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:55:01,881 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:55:01,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:55:01,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1756383024, now seen corresponding path program 1 times [2020-08-22 21:55:01,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:55:01,894 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [303027731] [2020-08-22 21:55:01,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:55:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:02,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:55:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:02,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 21:55:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 21:55:02,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [303027731] [2020-08-22 21:55:02,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 21:55:02,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 21:55:02,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813571745] [2020-08-22 21:55:02,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 21:55:02,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:55:02,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 21:55:02,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 21:55:02,148 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2020-08-22 21:55:02,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:55:02,255 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-08-22 21:55:02,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 21:55:02,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-08-22 21:55:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:55:02,267 INFO L225 Difference]: With dead ends: 44 [2020-08-22 21:55:02,268 INFO L226 Difference]: Without dead ends: 28 [2020-08-22 21:55:02,272 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-08-22 21:55:02,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-08-22 21:55:02,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-08-22 21:55:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-08-22 21:55:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-08-22 21:55:02,319 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2020-08-22 21:55:02,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:55:02,320 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-08-22 21:55:02,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 21:55:02,320 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-08-22 21:55:02,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-08-22 21:55:02,322 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:55:02,323 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:55:02,323 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 21:55:02,323 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:55:02,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:55:02,324 INFO L82 PathProgramCache]: Analyzing trace with hash -389703589, now seen corresponding path program 1 times [2020-08-22 21:55:02,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:55:02,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1864806957] [2020-08-22 21:55:02,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:55:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:02,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:55:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:02,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 21:55:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 21:55:02,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1864806957] [2020-08-22 21:55:02,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 21:55:02,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 21:55:02,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806470197] [2020-08-22 21:55:02,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 21:55:02,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:55:02,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 21:55:02,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 21:55:02,401 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2020-08-22 21:55:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:55:02,486 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-08-22 21:55:02,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 21:55:02,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-08-22 21:55:02,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:55:02,489 INFO L225 Difference]: With dead ends: 36 [2020-08-22 21:55:02,489 INFO L226 Difference]: Without dead ends: 30 [2020-08-22 21:55:02,491 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-08-22 21:55:02,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-22 21:55:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-08-22 21:55:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-08-22 21:55:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-08-22 21:55:02,503 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2020-08-22 21:55:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:55:02,504 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-08-22 21:55:02,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 21:55:02,504 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-08-22 21:55:02,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-08-22 21:55:02,506 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:55:02,506 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-08-22 21:55:02,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 21:55:02,507 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:55:02,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:55:02,507 INFO L82 PathProgramCache]: Analyzing trace with hash 50309368, now seen corresponding path program 1 times [2020-08-22 21:55:02,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:55:02,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [426473830] [2020-08-22 21:55:02,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:55:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:02,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:55:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:02,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 21:55:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:02,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:02,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 21:55:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 21:55:02,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [426473830] [2020-08-22 21:55:02,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:55:02,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 21:55:02,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983192660] [2020-08-22 21:55:02,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 21:55:02,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:55:02,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 21:55:02,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 21:55:02,683 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2020-08-22 21:55:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:55:02,786 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2020-08-22 21:55:02,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 21:55:02,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-08-22 21:55:02,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:55:02,788 INFO L225 Difference]: With dead ends: 52 [2020-08-22 21:55:02,788 INFO L226 Difference]: Without dead ends: 30 [2020-08-22 21:55:02,790 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-08-22 21:55:02,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-22 21:55:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-08-22 21:55:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-22 21:55:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-08-22 21:55:02,801 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 33 [2020-08-22 21:55:02,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:55:02,802 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-08-22 21:55:02,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 21:55:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-08-22 21:55:02,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-08-22 21:55:02,804 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:55:02,805 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-08-22 21:55:02,805 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 21:55:02,805 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:55:02,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:55:02,806 INFO L82 PathProgramCache]: Analyzing trace with hash -643371531, now seen corresponding path program 1 times [2020-08-22 21:55:02,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:55:02,806 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1803728650] [2020-08-22 21:55:02,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:55:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:02,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:55:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:02,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 21:55:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:02,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:02,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-22 21:55:02,931 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1803728650] [2020-08-22 21:55:02,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:55:02,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 21:55:02,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434169448] [2020-08-22 21:55:02,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 21:55:02,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:55:02,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 21:55:02,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 21:55:02,934 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-08-22 21:55:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:55:03,068 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2020-08-22 21:55:03,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 21:55:03,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-08-22 21:55:03,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:55:03,072 INFO L225 Difference]: With dead ends: 56 [2020-08-22 21:55:03,072 INFO L226 Difference]: Without dead ends: 50 [2020-08-22 21:55:03,073 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-08-22 21:55:03,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-08-22 21:55:03,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-08-22 21:55:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-08-22 21:55:03,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2020-08-22 21:55:03,089 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2020-08-22 21:55:03,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:55:03,090 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-08-22 21:55:03,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 21:55:03,090 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-08-22 21:55:03,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-22 21:55:03,092 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:55:03,092 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-08-22 21:55:03,093 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 21:55:03,093 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:55:03,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:55:03,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1274787059, now seen corresponding path program 2 times [2020-08-22 21:55:03,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:55:03,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [793475801] [2020-08-22 21:55:03,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:55:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:55:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 21:55:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-22 21:55:03,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [793475801] [2020-08-22 21:55:03,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:55:03,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 21:55:03,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498853038] [2020-08-22 21:55:03,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 21:55:03,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:55:03,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 21:55:03,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 21:55:03,247 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 8 states. [2020-08-22 21:55:03,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:55:03,405 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2020-08-22 21:55:03,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 21:55:03,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-08-22 21:55:03,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:55:03,409 INFO L225 Difference]: With dead ends: 111 [2020-08-22 21:55:03,409 INFO L226 Difference]: Without dead ends: 67 [2020-08-22 21:55:03,411 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-08-22 21:55:03,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-08-22 21:55:03,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2020-08-22 21:55:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-22 21:55:03,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2020-08-22 21:55:03,428 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 51 [2020-08-22 21:55:03,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:55:03,429 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-08-22 21:55:03,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 21:55:03,429 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2020-08-22 21:55:03,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-22 21:55:03,432 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:55:03,432 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-08-22 21:55:03,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 21:55:03,432 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:55:03,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:55:03,433 INFO L82 PathProgramCache]: Analyzing trace with hash 99184320, now seen corresponding path program 3 times [2020-08-22 21:55:03,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:55:03,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1632458861] [2020-08-22 21:55:03,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:55:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:55:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 21:55:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-22 21:55:03,552 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1632458861] [2020-08-22 21:55:03,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:55:03,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 21:55:03,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825101871] [2020-08-22 21:55:03,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 21:55:03,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:55:03,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 21:55:03,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 21:55:03,554 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand 7 states. [2020-08-22 21:55:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:55:03,673 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2020-08-22 21:55:03,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 21:55:03,674 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2020-08-22 21:55:03,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:55:03,677 INFO L225 Difference]: With dead ends: 89 [2020-08-22 21:55:03,677 INFO L226 Difference]: Without dead ends: 83 [2020-08-22 21:55:03,678 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-08-22 21:55:03,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-08-22 21:55:03,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2020-08-22 21:55:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-08-22 21:55:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2020-08-22 21:55:03,698 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 52 [2020-08-22 21:55:03,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:55:03,699 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2020-08-22 21:55:03,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 21:55:03,699 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2020-08-22 21:55:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-08-22 21:55:03,704 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:55:03,705 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-08-22 21:55:03,705 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 21:55:03,705 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:55:03,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:55:03,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1883941443, now seen corresponding path program 4 times [2020-08-22 21:55:03,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:55:03,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [541064527] [2020-08-22 21:55:03,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:55:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:55:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 21:55:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:03,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 130 proven. 176 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-08-22 21:55:04,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [541064527] [2020-08-22 21:55:04,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:55:04,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-22 21:55:04,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333037399] [2020-08-22 21:55:04,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 21:55:04,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:55:04,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 21:55:04,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-08-22 21:55:04,192 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand 11 states. [2020-08-22 21:55:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:55:04,534 INFO L93 Difference]: Finished difference Result 142 states and 213 transitions. [2020-08-22 21:55:04,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 21:55:04,535 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2020-08-22 21:55:04,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:55:04,538 INFO L225 Difference]: With dead ends: 142 [2020-08-22 21:55:04,539 INFO L226 Difference]: Without dead ends: 73 [2020-08-22 21:55:04,541 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-08-22 21:55:04,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-08-22 21:55:04,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2020-08-22 21:55:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-22 21:55:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2020-08-22 21:55:04,558 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 123 [2020-08-22 21:55:04,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:55:04,560 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2020-08-22 21:55:04,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 21:55:04,561 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2020-08-22 21:55:04,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-08-22 21:55:04,565 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:55:04,565 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-08-22 21:55:04,566 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 21:55:04,566 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:55:04,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:55:04,566 INFO L82 PathProgramCache]: Analyzing trace with hash 532445701, now seen corresponding path program 5 times [2020-08-22 21:55:04,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:55:04,570 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2031345373] [2020-08-22 21:55:04,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:55:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:55:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 21:55:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:04,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 375 proven. 413 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2020-08-22 21:55:05,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2031345373] [2020-08-22 21:55:05,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:55:05,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-22 21:55:05,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933263552] [2020-08-22 21:55:05,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 21:55:05,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:55:05,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 21:55:05,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-08-22 21:55:05,055 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 13 states. [2020-08-22 21:55:05,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:55:05,509 INFO L93 Difference]: Finished difference Result 149 states and 204 transitions. [2020-08-22 21:55:05,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-22 21:55:05,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 193 [2020-08-22 21:55:05,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:55:05,512 INFO L225 Difference]: With dead ends: 149 [2020-08-22 21:55:05,512 INFO L226 Difference]: Without dead ends: 92 [2020-08-22 21:55:05,514 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2020-08-22 21:55:05,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-08-22 21:55:05,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2020-08-22 21:55:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-08-22 21:55:05,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2020-08-22 21:55:05,530 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 193 [2020-08-22 21:55:05,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:55:05,530 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2020-08-22 21:55:05,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 21:55:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2020-08-22 21:55:05,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2020-08-22 21:55:05,536 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:55:05,536 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-08-22 21:55:05,536 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 21:55:05,536 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:55:05,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:55:05,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2080077336, now seen corresponding path program 6 times [2020-08-22 21:55:05,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:55:05,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [507559838] [2020-08-22 21:55:05,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:55:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:55:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 21:55:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 21:55:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:05,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:06,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:06,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:06,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:06,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:06,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:06,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:06,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:06,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:06,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:06,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:06,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2955 backedges. 552 proven. 920 refuted. 0 times theorem prover too weak. 1483 trivial. 0 not checked. [2020-08-22 21:55:06,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [507559838] [2020-08-22 21:55:06,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:55:06,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-08-22 21:55:06,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378112628] [2020-08-22 21:55:06,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-22 21:55:06,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:55:06,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-22 21:55:06,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2020-08-22 21:55:06,187 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand 15 states. [2020-08-22 21:55:06,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:55:06,813 INFO L93 Difference]: Finished difference Result 194 states and 284 transitions. [2020-08-22 21:55:06,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-08-22 21:55:06,814 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 281 [2020-08-22 21:55:06,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:55:06,817 INFO L225 Difference]: With dead ends: 194 [2020-08-22 21:55:06,817 INFO L226 Difference]: Without dead ends: 119 [2020-08-22 21:55:06,819 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=877, Unknown=0, NotChecked=0, Total=1122 [2020-08-22 21:55:06,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-08-22 21:55:06,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2020-08-22 21:55:06,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-08-22 21:55:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 138 transitions. [2020-08-22 21:55:06,837 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 138 transitions. Word has length 281 [2020-08-22 21:55:06,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:55:06,838 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 138 transitions. [2020-08-22 21:55:06,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-22 21:55:06,838 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 138 transitions. [2020-08-22 21:55:06,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2020-08-22 21:55:06,844 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:55:06,845 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-08-22 21:55:06,845 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 21:55:06,845 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:55:06,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:55:06,845 INFO L82 PathProgramCache]: Analyzing trace with hash 260846875, now seen corresponding path program 7 times [2020-08-22 21:55:06,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:55:06,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1944222334] [2020-08-22 21:55:06,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:55:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:06,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:55:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:06,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 21:55:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 21:55:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-08-22 21:55:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5244 backedges. 264 proven. 1364 refuted. 0 times theorem prover too weak. 3616 trivial. 0 not checked. [2020-08-22 21:55:07,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1944222334] [2020-08-22 21:55:07,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:55:07,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-22 21:55:07,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820667195] [2020-08-22 21:55:07,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 21:55:07,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:55:07,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 21:55:07,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-22 21:55:07,750 INFO L87 Difference]: Start difference. First operand 109 states and 138 transitions. Second operand 11 states. [2020-08-22 21:55:07,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:55:07,994 INFO L93 Difference]: Finished difference Result 356 states and 488 transitions. [2020-08-22 21:55:07,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 21:55:07,995 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 369 [2020-08-22 21:55:07,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:55:08,001 INFO L225 Difference]: With dead ends: 356 [2020-08-22 21:55:08,001 INFO L226 Difference]: Without dead ends: 350 [2020-08-22 21:55:08,002 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-08-22 21:55:08,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-08-22 21:55:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 320. [2020-08-22 21:55:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2020-08-22 21:55:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 441 transitions. [2020-08-22 21:55:08,044 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 441 transitions. Word has length 369 [2020-08-22 21:55:08,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:55:08,045 INFO L479 AbstractCegarLoop]: Abstraction has 320 states and 441 transitions. [2020-08-22 21:55:08,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 21:55:08,045 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 441 transitions. [2020-08-22 21:55:08,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2020-08-22 21:55:08,069 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:55:08,070 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-08-22 21:55:08,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 21:55:08,070 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:55:08,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:55:08,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1826894978, now seen corresponding path program 8 times [2020-08-22 21:55:08,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:55:08,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [269876816] [2020-08-22 21:55:08,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:55:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:08,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:55:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:08,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 21:55:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:08,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:08,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:08,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:08,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 21:55:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-08-22 21:55:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2020-08-22 21:55:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 21:55:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-08-22 21:55:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:09,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 22008 backedges. 2418 proven. 4356 refuted. 0 times theorem prover too weak. 15234 trivial. 0 not checked. [2020-08-22 21:55:11,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [269876816] [2020-08-22 21:55:11,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:55:11,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-22 21:55:11,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672777456] [2020-08-22 21:55:11,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-22 21:55:11,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:55:11,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-22 21:55:11,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2020-08-22 21:55:11,011 INFO L87 Difference]: Start difference. First operand 320 states and 441 transitions. Second operand 19 states. [2020-08-22 21:55:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:55:11,913 INFO L93 Difference]: Finished difference Result 481 states and 761 transitions. [2020-08-22 21:55:11,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-08-22 21:55:11,914 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 739 [2020-08-22 21:55:11,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:55:11,919 INFO L225 Difference]: With dead ends: 481 [2020-08-22 21:55:11,920 INFO L226 Difference]: Without dead ends: 175 [2020-08-22 21:55:11,924 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=447, Invalid=1809, Unknown=0, NotChecked=0, Total=2256 [2020-08-22 21:55:11,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-08-22 21:55:11,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 149. [2020-08-22 21:55:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-08-22 21:55:11,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 201 transitions. [2020-08-22 21:55:11,943 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 201 transitions. Word has length 739 [2020-08-22 21:55:11,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:55:11,945 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 201 transitions. [2020-08-22 21:55:11,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-22 21:55:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 201 transitions. [2020-08-22 21:55:11,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 969 [2020-08-22 21:55:11,979 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:55:11,980 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-08-22 21:55:11,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 21:55:11,980 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:55:11,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:55:11,981 INFO L82 PathProgramCache]: Analyzing trace with hash -668436832, now seen corresponding path program 9 times [2020-08-22 21:55:11,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:55:11,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2128242572] [2020-08-22 21:55:11,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:55:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:12,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:55:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:12,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 21:55:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 21:55:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-08-22 21:55:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:13,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2020-08-22 21:55:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 21:55:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 592 [2020-08-22 21:55:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 21:55:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-08-22 21:55:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:14,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 38160 backedges. 950 proven. 5310 refuted. 0 times theorem prover too weak. 31900 trivial. 0 not checked. [2020-08-22 21:55:16,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2128242572] [2020-08-22 21:55:16,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:55:16,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-22 21:55:16,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723168425] [2020-08-22 21:55:16,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 21:55:16,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:55:16,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 21:55:16,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-22 21:55:16,155 INFO L87 Difference]: Start difference. First operand 149 states and 201 transitions. Second operand 13 states. [2020-08-22 21:55:16,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:55:16,530 INFO L93 Difference]: Finished difference Result 624 states and 903 transitions. [2020-08-22 21:55:16,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-22 21:55:16,531 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 968 [2020-08-22 21:55:16,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:55:16,546 INFO L225 Difference]: With dead ends: 624 [2020-08-22 21:55:16,546 INFO L226 Difference]: Without dead ends: 618 [2020-08-22 21:55:16,548 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-08-22 21:55:16,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-08-22 21:55:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 576. [2020-08-22 21:55:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2020-08-22 21:55:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 833 transitions. [2020-08-22 21:55:16,622 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 833 transitions. Word has length 968 [2020-08-22 21:55:16,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:55:16,623 INFO L479 AbstractCegarLoop]: Abstraction has 576 states and 833 transitions. [2020-08-22 21:55:16,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 21:55:16,623 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 833 transitions. [2020-08-22 21:55:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1938 [2020-08-22 21:55:16,654 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:55:16,655 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-08-22 21:55:16,655 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 21:55:16,656 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:55:16,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:55:16,656 INFO L82 PathProgramCache]: Analyzing trace with hash -108146952, now seen corresponding path program 10 times [2020-08-22 21:55:16,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:55:16,657 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [141332707] [2020-08-22 21:55:16,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:55:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:18,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:55:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:18,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 21:55:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:19,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:19,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 21:55:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-08-22 21:55:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2020-08-22 21:55:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 21:55:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 592 [2020-08-22 21:55:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:20,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 21:55:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-08-22 21:55:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 962 [2020-08-22 21:55:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:21,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 21:55:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-08-22 21:55:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2020-08-22 21:55:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 21:55:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 592 [2020-08-22 21:55:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:22,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 21:55:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-08-22 21:55:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:55:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:55:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:55:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:55:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:23,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:55:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:55:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 155401 backedges. 8774 proven. 16708 refuted. 0 times theorem prover too weak. 129919 trivial. 0 not checked. [2020-08-22 21:55:26,037 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [141332707] [2020-08-22 21:55:26,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:55:26,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-08-22 21:55:26,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584208953] [2020-08-22 21:55:26,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-08-22 21:55:26,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:55:26,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-08-22 21:55:26,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2020-08-22 21:55:26,041 INFO L87 Difference]: Start difference. First operand 576 states and 833 transitions. Second operand 23 states. [2020-08-22 21:55:27,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:55:27,311 INFO L93 Difference]: Finished difference Result 808 states and 1346 transitions. [2020-08-22 21:55:27,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-08-22 21:55:27,311 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1937 [2020-08-22 21:55:27,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:55:27,325 INFO L225 Difference]: With dead ends: 808 [2020-08-22 21:55:27,325 INFO L226 Difference]: Without dead ends: 246 [2020-08-22 21:55:27,336 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=684, Invalid=2976, Unknown=0, NotChecked=0, Total=3660 [2020-08-22 21:55:27,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-08-22 21:55:27,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 195. [2020-08-22 21:55:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-08-22 21:55:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 283 transitions. [2020-08-22 21:55:27,360 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 283 transitions. Word has length 1937 [2020-08-22 21:55:27,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:55:27,363 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 283 transitions. [2020-08-22 21:55:27,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-08-22 21:55:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 283 transitions. [2020-08-22 21:55:27,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1568 [2020-08-22 21:55:27,381 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:55:27,382 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-08-22 21:55:27,382 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 21:55:27,382 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:55:27,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:55:27,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1218167635, now seen corresponding path program 11 times [2020-08-22 21:55:27,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:55:27,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1037937496] [2020-08-22 21:55:27,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:55:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 21:55:27,924 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 21:55:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 21:55:28,300 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 21:55:28,439 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-22 21:55:28,439 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 21:55:28,439 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-22 21:55:28,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 09:55:28 BoogieIcfgContainer [2020-08-22 21:55:28,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 21:55:28,621 INFO L168 Benchmark]: Toolchain (without parser) took 27490.66 ms. Allocated memory was 145.8 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 102.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2020-08-22 21:55:28,621 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 145.8 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-22 21:55:28,622 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.86 ms. Allocated memory is still 145.8 MB. Free memory was 102.6 MB in the beginning and 93.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-22 21:55:28,623 INFO L168 Benchmark]: Boogie Preprocessor took 117.43 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 93.3 MB in the beginning and 181.9 MB in the end (delta: -88.7 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-08-22 21:55:28,624 INFO L168 Benchmark]: RCFGBuilder took 254.64 ms. Allocated memory is still 202.9 MB. Free memory was 181.9 MB in the beginning and 169.3 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2020-08-22 21:55:28,629 INFO L168 Benchmark]: TraceAbstraction took 26884.06 ms. Allocated memory was 202.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 168.6 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2020-08-22 21:55:28,632 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.24 ms. Allocated memory is still 145.8 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 228.86 ms. Allocated memory is still 145.8 MB. Free memory was 102.6 MB in the beginning and 93.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.43 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 93.3 MB in the beginning and 181.9 MB in the end (delta: -88.7 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 254.64 ms. Allocated memory is still 202.9 MB. Free memory was 181.9 MB in the beginning and 169.3 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26884.06 ms. Allocated memory was 202.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 168.6 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. 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: 26.6s, OverallIterations: 14, TraceHistogramMax: 219, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 472 SDtfs, 1382 SDslu, 1560 SDs, 0 SdLazy, 2280 SolverSat, 834 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1390 GetRequests, 1131 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 3.0s 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.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 189 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 16.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...