/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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.2.0-7d8eed3 [2020-11-07 04:51:36,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 04:51:36,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 04:51:36,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 04:51:36,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 04:51:36,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 04:51:36,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 04:51:36,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 04:51:36,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 04:51:36,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 04:51:36,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 04:51:36,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 04:51:36,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 04:51:36,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 04:51:36,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 04:51:36,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 04:51:36,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 04:51:36,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 04:51:36,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 04:51:36,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 04:51:36,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 04:51:36,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 04:51:36,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 04:51:36,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 04:51:36,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 04:51:36,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 04:51:36,487 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 04:51:36,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 04:51:36,488 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 04:51:36,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 04:51:36,489 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 04:51:36,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 04:51:36,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 04:51:36,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 04:51:36,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 04:51:36,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 04:51:36,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 04:51:36,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 04:51:36,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 04:51:36,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 04:51:36,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 04:51:36,504 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 04:51:36,516 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 04:51:36,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 04:51:36,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 04:51:36,518 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 04:51:36,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 04:51:36,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 04:51:36,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 04:51:36,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 04:51:36,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 04:51:36,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 04:51:36,519 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 04:51:36,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 04:51:36,519 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 04:51:36,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 04:51:36,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 04:51:36,520 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 04:51:36,520 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 04:51:36,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 04:51:36,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 04:51:36,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 04:51:36,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 04:51:36,521 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 04:51:36,521 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-11-07 04:51:36,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 04:51:36,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 04:51:36,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 04:51:36,910 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 04:51:36,911 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 04:51:36,912 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-11-07 04:51:36,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aff0aec7/5141be112902466589beadfb1ed6bbc7/FLAGed1eb9be7 [2020-11-07 04:51:37,621 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 04:51:37,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-11-07 04:51:37,629 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aff0aec7/5141be112902466589beadfb1ed6bbc7/FLAGed1eb9be7 [2020-11-07 04:51:37,972 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aff0aec7/5141be112902466589beadfb1ed6bbc7 [2020-11-07 04:51:37,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 04:51:37,984 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 04:51:37,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 04:51:37,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 04:51:37,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 04:51:37,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:51:37" (1/1) ... [2020-11-07 04:51:37,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@738b9d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:37, skipping insertion in model container [2020-11-07 04:51:37,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:51:37" (1/1) ... [2020-11-07 04:51:38,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 04:51:38,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 04:51:38,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 04:51:38,261 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 04:51:38,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 04:51:38,302 INFO L208 MainTranslator]: Completed translation [2020-11-07 04:51:38,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:38 WrapperNode [2020-11-07 04:51:38,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 04:51:38,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 04:51:38,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 04:51:38,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 04:51:38,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:38" (1/1) ... [2020-11-07 04:51:38,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:38" (1/1) ... [2020-11-07 04:51:38,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:38" (1/1) ... [2020-11-07 04:51:38,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:38" (1/1) ... [2020-11-07 04:51:38,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:38" (1/1) ... [2020-11-07 04:51:38,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:38" (1/1) ... [2020-11-07 04:51:38,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:38" (1/1) ... [2020-11-07 04:51:38,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 04:51:38,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 04:51:38,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 04:51:38,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 04:51:38,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:38" (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-11-07 04:51:38,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 04:51:38,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 04:51:38,471 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 04:51:38,472 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-11-07 04:51:38,472 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 04:51:38,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 04:51:38,473 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 04:51:38,473 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 04:51:38,474 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 04:51:38,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 04:51:38,474 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-11-07 04:51:38,475 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 04:51:38,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 04:51:38,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 04:51:38,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 04:51:38,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 04:51:38,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 04:51:38,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 04:51:39,031 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 04:51:39,032 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 04:51:39,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:51:39 BoogieIcfgContainer [2020-11-07 04:51:39,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 04:51:39,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 04:51:39,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 04:51:39,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 04:51:39,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:51:37" (1/3) ... [2020-11-07 04:51:39,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f93716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:51:39, skipping insertion in model container [2020-11-07 04:51:39,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:38" (2/3) ... [2020-11-07 04:51:39,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f93716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:51:39, skipping insertion in model container [2020-11-07 04:51:39,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:51:39" (3/3) ... [2020-11-07 04:51:39,053 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-11-07 04:51:39,071 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 04:51:39,075 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 04:51:39,092 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 04:51:39,131 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 04:51:39,131 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 04:51:39,131 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 04:51:39,132 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 04:51:39,132 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 04:51:39,132 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 04:51:39,132 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 04:51:39,132 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 04:51:39,152 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-11-07 04:51:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 04:51:39,178 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:39,179 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:51:39,180 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:39,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:39,192 INFO L82 PathProgramCache]: Analyzing trace with hash -32329728, now seen corresponding path program 1 times [2020-11-07 04:51:39,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:39,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [326762452] [2020-11-07 04:51:39,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:39,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:51:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:39,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 04:51:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:39,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 04:51:39,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [326762452] [2020-11-07 04:51:39,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:51:39,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 04:51:39,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020934230] [2020-11-07 04:51:39,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 04:51:39,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:39,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 04:51:39,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 04:51:39,685 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 6 states. [2020-11-07 04:51:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:40,162 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2020-11-07 04:51:40,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 04:51:40,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 04:51:40,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:40,173 INFO L225 Difference]: With dead ends: 60 [2020-11-07 04:51:40,174 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 04:51:40,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 04:51:40,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 04:51:40,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 04:51:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 04:51:40,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-07 04:51:40,238 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2020-11-07 04:51:40,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:40,238 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-07 04:51:40,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 04:51:40,239 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-11-07 04:51:40,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 04:51:40,241 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:40,241 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:51:40,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 04:51:40,242 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:40,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:40,243 INFO L82 PathProgramCache]: Analyzing trace with hash 950139466, now seen corresponding path program 1 times [2020-11-07 04:51:40,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:40,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [476994849] [2020-11-07 04:51:40,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:40,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:51:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:40,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 04:51:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 04:51:40,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [476994849] [2020-11-07 04:51:40,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:51:40,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 04:51:40,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430111229] [2020-11-07 04:51:40,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 04:51:40,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:40,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 04:51:40,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 04:51:40,395 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2020-11-07 04:51:40,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:40,705 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-11-07 04:51:40,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 04:51:40,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 04:51:40,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:40,708 INFO L225 Difference]: With dead ends: 46 [2020-11-07 04:51:40,708 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 04:51:40,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 04:51:40,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 04:51:40,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-11-07 04:51:40,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 04:51:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-07 04:51:40,724 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2020-11-07 04:51:40,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:40,725 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-07 04:51:40,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 04:51:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-11-07 04:51:40,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 04:51:40,727 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:40,727 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:51:40,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 04:51:40,728 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:40,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:40,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1810718643, now seen corresponding path program 1 times [2020-11-07 04:51:40,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:40,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1566176989] [2020-11-07 04:51:40,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:40,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:51:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:40,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 04:51:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:40,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:40,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 04:51:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 04:51:40,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1566176989] [2020-11-07 04:51:40,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:51:40,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 04:51:40,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040360535] [2020-11-07 04:51:40,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 04:51:40,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:40,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 04:51:40,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 04:51:40,912 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2020-11-07 04:51:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:41,231 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-11-07 04:51:41,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 04:51:41,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 04:51:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:41,233 INFO L225 Difference]: With dead ends: 62 [2020-11-07 04:51:41,234 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 04:51:41,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-11-07 04:51:41,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 04:51:41,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 04:51:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 04:51:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-11-07 04:51:41,248 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 42 [2020-11-07 04:51:41,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:41,249 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-07 04:51:41,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 04:51:41,249 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-11-07 04:51:41,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 04:51:41,251 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:41,251 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:51:41,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 04:51:41,252 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:41,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:41,252 INFO L82 PathProgramCache]: Analyzing trace with hash 195045207, now seen corresponding path program 1 times [2020-11-07 04:51:41,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:41,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [920847074] [2020-11-07 04:51:41,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:41,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:51:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:41,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 04:51:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:41,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:41,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:41,404 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 04:51:41,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [920847074] [2020-11-07 04:51:41,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:51:41,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 04:51:41,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889776606] [2020-11-07 04:51:41,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 04:51:41,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:41,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 04:51:41,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 04:51:41,407 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2020-11-07 04:51:41,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:41,819 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-11-07 04:51:41,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 04:51:41,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-11-07 04:51:41,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:41,823 INFO L225 Difference]: With dead ends: 66 [2020-11-07 04:51:41,823 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 04:51:41,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-07 04:51:41,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 04:51:41,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-07 04:51:41,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 04:51:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2020-11-07 04:51:41,845 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 43 [2020-11-07 04:51:41,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:41,846 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2020-11-07 04:51:41,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 04:51:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2020-11-07 04:51:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 04:51:41,849 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:41,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:51:41,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 04:51:41,849 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:41,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:41,850 INFO L82 PathProgramCache]: Analyzing trace with hash -396245802, now seen corresponding path program 2 times [2020-11-07 04:51:41,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:41,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [523550018] [2020-11-07 04:51:41,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:41,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:51:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:41,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 04:51:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:42,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:42,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:42,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:42,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-07 04:51:42,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [523550018] [2020-11-07 04:51:42,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:51:42,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 04:51:42,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152411307] [2020-11-07 04:51:42,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 04:51:42,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:42,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 04:51:42,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 04:51:42,110 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 8 states. [2020-11-07 04:51:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:42,670 INFO L93 Difference]: Finished difference Result 118 states and 161 transitions. [2020-11-07 04:51:42,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 04:51:42,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 04:51:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:42,675 INFO L225 Difference]: With dead ends: 118 [2020-11-07 04:51:42,675 INFO L226 Difference]: Without dead ends: 73 [2020-11-07 04:51:42,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 04:51:42,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-07 04:51:42,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2020-11-07 04:51:42,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-07 04:51:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2020-11-07 04:51:42,701 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 60 [2020-11-07 04:51:42,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:42,701 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2020-11-07 04:51:42,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 04:51:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2020-11-07 04:51:42,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 04:51:42,704 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:42,704 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:51:42,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 04:51:42,705 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:42,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:42,705 INFO L82 PathProgramCache]: Analyzing trace with hash -13012784, now seen corresponding path program 3 times [2020-11-07 04:51:42,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:42,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [884327810] [2020-11-07 04:51:42,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:42,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:51:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:42,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 04:51:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:42,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:42,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:42,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:42,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-07 04:51:42,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [884327810] [2020-11-07 04:51:42,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:51:42,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 04:51:42,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223560643] [2020-11-07 04:51:42,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 04:51:42,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:42,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 04:51:42,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 04:51:42,856 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 8 states. [2020-11-07 04:51:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:43,403 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2020-11-07 04:51:43,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 04:51:43,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-11-07 04:51:43,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:43,415 INFO L225 Difference]: With dead ends: 96 [2020-11-07 04:51:43,416 INFO L226 Difference]: Without dead ends: 89 [2020-11-07 04:51:43,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-11-07 04:51:43,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-07 04:51:43,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2020-11-07 04:51:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-11-07 04:51:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2020-11-07 04:51:43,482 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 61 [2020-11-07 04:51:43,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:43,483 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2020-11-07 04:51:43,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 04:51:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2020-11-07 04:51:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-07 04:51:43,491 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:43,491 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:51:43,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 04:51:43,492 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:43,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:43,492 INFO L82 PathProgramCache]: Analyzing trace with hash 159854214, now seen corresponding path program 4 times [2020-11-07 04:51:43,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:43,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [605369936] [2020-11-07 04:51:43,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:43,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:51:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:43,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 04:51:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:43,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:43,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:43,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:43,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:43,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:43,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:43,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:43,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:43,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:43,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:43,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:43,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 36 proven. 197 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2020-11-07 04:51:43,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [605369936] [2020-11-07 04:51:43,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:51:43,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 04:51:43,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184224087] [2020-11-07 04:51:43,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 04:51:43,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:43,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 04:51:43,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 04:51:43,944 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand 9 states. [2020-11-07 04:51:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:44,593 INFO L93 Difference]: Finished difference Result 146 states and 199 transitions. [2020-11-07 04:51:44,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 04:51:44,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2020-11-07 04:51:44,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:44,599 INFO L225 Difference]: With dead ends: 146 [2020-11-07 04:51:44,599 INFO L226 Difference]: Without dead ends: 139 [2020-11-07 04:51:44,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-11-07 04:51:44,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-07 04:51:44,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 127. [2020-11-07 04:51:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-07 04:51:44,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2020-11-07 04:51:44,645 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 132 [2020-11-07 04:51:44,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:44,645 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2020-11-07 04:51:44,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 04:51:44,646 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2020-11-07 04:51:44,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-11-07 04:51:44,652 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:44,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:51:44,652 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 04:51:44,652 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:44,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:44,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1497778840, now seen corresponding path program 5 times [2020-11-07 04:51:44,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:44,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [367485413] [2020-11-07 04:51:44,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:44,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:51:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:44,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 04:51:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:44,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:44,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:44,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:44,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:44,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:44,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:44,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:44,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:44,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:44,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:51:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:44,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:44,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:44,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:44,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:44,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:44,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:44,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:45,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:45,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:45,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:51:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 78 proven. 452 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2020-11-07 04:51:45,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [367485413] [2020-11-07 04:51:45,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:51:45,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 04:51:45,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586329755] [2020-11-07 04:51:45,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 04:51:45,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:45,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 04:51:45,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 04:51:45,081 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand 10 states. [2020-11-07 04:51:45,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:45,855 INFO L93 Difference]: Finished difference Result 240 states and 348 transitions. [2020-11-07 04:51:45,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 04:51:45,856 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 202 [2020-11-07 04:51:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:45,866 INFO L225 Difference]: With dead ends: 240 [2020-11-07 04:51:45,866 INFO L226 Difference]: Without dead ends: 233 [2020-11-07 04:51:45,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2020-11-07 04:51:45,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-11-07 04:51:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 215. [2020-11-07 04:51:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-11-07 04:51:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2020-11-07 04:51:46,003 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 202 [2020-11-07 04:51:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:46,006 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2020-11-07 04:51:46,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 04:51:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2020-11-07 04:51:46,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-11-07 04:51:46,017 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:46,017 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:51:46,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 04:51:46,017 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:46,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:46,018 INFO L82 PathProgramCache]: Analyzing trace with hash -509020704, now seen corresponding path program 6 times [2020-11-07 04:51:46,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:46,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [52449909] [2020-11-07 04:51:46,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:51:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 04:51:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:51:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 04:51:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:46,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 126 proven. 642 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2020-11-07 04:51:46,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [52449909] [2020-11-07 04:51:46,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:51:46,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 04:51:46,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091741677] [2020-11-07 04:51:46,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 04:51:46,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:46,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 04:51:46,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 04:51:46,680 INFO L87 Difference]: Start difference. First operand 215 states and 319 transitions. Second operand 11 states. [2020-11-07 04:51:47,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:47,709 INFO L93 Difference]: Finished difference Result 422 states and 653 transitions. [2020-11-07 04:51:47,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 04:51:47,710 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 237 [2020-11-07 04:51:47,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:47,718 INFO L225 Difference]: With dead ends: 422 [2020-11-07 04:51:47,718 INFO L226 Difference]: Without dead ends: 415 [2020-11-07 04:51:47,720 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2020-11-07 04:51:47,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2020-11-07 04:51:47,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 391. [2020-11-07 04:51:47,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-11-07 04:51:47,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 617 transitions. [2020-11-07 04:51:47,806 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 617 transitions. Word has length 237 [2020-11-07 04:51:47,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:47,807 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 617 transitions. [2020-11-07 04:51:47,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 04:51:47,807 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 617 transitions. [2020-11-07 04:51:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2020-11-07 04:51:47,818 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:47,818 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 15, 15, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:51:47,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 04:51:47,819 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:47,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:47,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1781154385, now seen corresponding path program 7 times [2020-11-07 04:51:47,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:47,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1399140672] [2020-11-07 04:51:47,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:51:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 04:51:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:51:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 04:51:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 04:51:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:51:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 04:51:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:48,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:49,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6939 backedges. 1724 proven. 1617 refuted. 0 times theorem prover too weak. 3598 trivial. 0 not checked. [2020-11-07 04:51:49,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1399140672] [2020-11-07 04:51:49,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:51:49,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 04:51:49,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109027859] [2020-11-07 04:51:49,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 04:51:49,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:49,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 04:51:49,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2020-11-07 04:51:49,477 INFO L87 Difference]: Start difference. First operand 391 states and 617 transitions. Second operand 18 states. [2020-11-07 04:51:52,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:52,467 INFO L93 Difference]: Finished difference Result 537 states and 953 transitions. [2020-11-07 04:51:52,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-07 04:51:52,468 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 431 [2020-11-07 04:51:52,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:52,475 INFO L225 Difference]: With dead ends: 537 [2020-11-07 04:51:52,475 INFO L226 Difference]: Without dead ends: 159 [2020-11-07 04:51:52,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=513, Invalid=2037, Unknown=0, NotChecked=0, Total=2550 [2020-11-07 04:51:52,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-11-07 04:51:52,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2020-11-07 04:51:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-07 04:51:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 174 transitions. [2020-11-07 04:51:52,515 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 174 transitions. Word has length 431 [2020-11-07 04:51:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:52,516 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 174 transitions. [2020-11-07 04:51:52,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 04:51:52,516 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 174 transitions. [2020-11-07 04:51:52,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2020-11-07 04:51:52,533 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:52,533 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 21, 21, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:51:52,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 04:51:52,533 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:52,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:52,534 INFO L82 PathProgramCache]: Analyzing trace with hash -240553225, now seen corresponding path program 8 times [2020-11-07 04:51:52,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:52,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [626710893] [2020-11-07 04:51:52,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:52,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:51:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:52,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 04:51:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:51:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 04:51:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 04:51:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:51:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2020-11-07 04:51:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:51:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 04:51:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:53,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:54,370 INFO L134 CoverageAnalysis]: Checked inductivity of 14259 backedges. 514 proven. 2746 refuted. 0 times theorem prover too weak. 10999 trivial. 0 not checked. [2020-11-07 04:51:54,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [626710893] [2020-11-07 04:51:54,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:51:54,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 04:51:54,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426716083] [2020-11-07 04:51:54,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 04:51:54,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:54,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 04:51:54,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 04:51:54,372 INFO L87 Difference]: Start difference. First operand 134 states and 174 transitions. Second operand 13 states. [2020-11-07 04:51:55,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:55,633 INFO L93 Difference]: Finished difference Result 486 states and 687 transitions. [2020-11-07 04:51:55,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 04:51:55,634 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 607 [2020-11-07 04:51:55,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:55,646 INFO L225 Difference]: With dead ends: 486 [2020-11-07 04:51:55,646 INFO L226 Difference]: Without dead ends: 479 [2020-11-07 04:51:55,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2020-11-07 04:51:55,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2020-11-07 04:51:55,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 443. [2020-11-07 04:51:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2020-11-07 04:51:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 629 transitions. [2020-11-07 04:51:55,736 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 629 transitions. Word has length 607 [2020-11-07 04:51:55,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:55,739 INFO L481 AbstractCegarLoop]: Abstraction has 443 states and 629 transitions. [2020-11-07 04:51:55,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 04:51:55,739 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 629 transitions. [2020-11-07 04:51:55,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 978 [2020-11-07 04:51:55,768 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:55,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:51:55,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 04:51:55,769 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:55,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:55,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1189682992, now seen corresponding path program 9 times [2020-11-07 04:51:55,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:55,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1910835002] [2020-11-07 04:51:55,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:56,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:51:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:56,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 04:51:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:56,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:56,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:51:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 04:51:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 04:51:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:51:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2020-11-07 04:51:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:51:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 04:51:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:57,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 592 [2020-11-07 04:51:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:51:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 04:51:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 04:51:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:51:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:58,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:59,223 INFO L134 CoverageAnalysis]: Checked inductivity of 38160 backedges. 950 proven. 5310 refuted. 0 times theorem prover too weak. 31900 trivial. 0 not checked. [2020-11-07 04:51:59,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1910835002] [2020-11-07 04:51:59,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:51:59,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 04:51:59,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324399010] [2020-11-07 04:51:59,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 04:51:59,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:59,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 04:51:59,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-07 04:51:59,226 INFO L87 Difference]: Start difference. First operand 443 states and 629 transitions. Second operand 14 states. [2020-11-07 04:52:00,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:52:00,961 INFO L93 Difference]: Finished difference Result 1339 states and 2002 transitions. [2020-11-07 04:52:00,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 04:52:00,962 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 977 [2020-11-07 04:52:00,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:52:00,992 INFO L225 Difference]: With dead ends: 1339 [2020-11-07 04:52:00,992 INFO L226 Difference]: Without dead ends: 1332 [2020-11-07 04:52:00,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=307, Invalid=685, Unknown=0, NotChecked=0, Total=992 [2020-11-07 04:52:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2020-11-07 04:52:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1290. [2020-11-07 04:52:01,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2020-11-07 04:52:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1935 transitions. [2020-11-07 04:52:01,330 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1935 transitions. Word has length 977 [2020-11-07 04:52:01,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:52:01,331 INFO L481 AbstractCegarLoop]: Abstraction has 1290 states and 1935 transitions. [2020-11-07 04:52:01,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 04:52:01,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1935 transitions. [2020-11-07 04:52:01,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1577 [2020-11-07 04:52:01,427 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:52:01,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:52:01,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 04:52:01,428 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:52:01,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:52:01,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2120852588, now seen corresponding path program 10 times [2020-11-07 04:52:01,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:52:01,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [287689174] [2020-11-07 04:52:01,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:52:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 04:52:01,849 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 04:52:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 04:52:02,272 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 04:52:03,309 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 04:52:03,309 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 04:52:03,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 04:52:03,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:52:03 BoogieIcfgContainer [2020-11-07 04:52:03,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 04:52:03,609 INFO L168 Benchmark]: Toolchain (without parser) took 25628.86 ms. Allocated memory was 151.0 MB in the beginning and 1.0 GB in the end (delta: 855.6 MB). Free memory was 126.6 MB in the beginning and 396.9 MB in the end (delta: -270.3 MB). Peak memory consumption was 586.6 MB. Max. memory is 8.0 GB. [2020-11-07 04:52:03,609 INFO L168 Benchmark]: CDTParser took 0.93 ms. Allocated memory is still 151.0 MB. Free memory is still 124.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 04:52:03,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.17 ms. Allocated memory is still 151.0 MB. Free memory was 126.0 MB in the beginning and 116.4 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 04:52:03,611 INFO L168 Benchmark]: Boogie Preprocessor took 57.82 ms. Allocated memory is still 151.0 MB. Free memory was 116.4 MB in the beginning and 115.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 04:52:03,611 INFO L168 Benchmark]: RCFGBuilder took 674.11 ms. Allocated memory is still 151.0 MB. Free memory was 115.0 MB in the beginning and 101.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-07 04:52:03,612 INFO L168 Benchmark]: TraceAbstraction took 24564.67 ms. Allocated memory was 151.0 MB in the beginning and 1.0 GB in the end (delta: 855.6 MB). Free memory was 101.0 MB in the beginning and 396.9 MB in the end (delta: -295.9 MB). Peak memory consumption was 560.4 MB. Max. memory is 8.0 GB. [2020-11-07 04:52:03,615 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.93 ms. Allocated memory is still 151.0 MB. Free memory is still 124.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 317.17 ms. Allocated memory is still 151.0 MB. Free memory was 126.0 MB in the beginning and 116.4 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 57.82 ms. Allocated memory is still 151.0 MB. Free memory was 116.4 MB in the beginning and 115.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 674.11 ms. Allocated memory is still 151.0 MB. Free memory was 115.0 MB in the beginning and 101.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 24564.67 ms. Allocated memory was 151.0 MB in the beginning and 1.0 GB in the end (delta: 855.6 MB). Free memory was 101.0 MB in the beginning and 396.9 MB in the end (delta: -295.9 MB). Peak memory consumption was 560.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = 10; VAL [x=10] [L27] CALL, EXPR fibo(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L8] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L10] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=7, \result=13, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=8, \result=21, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=7, \result=13, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=9, \result=34, fibo(n-1)=21, fibo(n-2)=13, n=9] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=7, \result=13, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=8, \result=21, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=10, \result=55, fibo(n-1)=34, fibo(n-2)=21, n=10] [L27] RET, EXPR fibo(x) VAL [fibo(x)=55, x=10] [L27] int result = fibo(x); VAL [fibo(x)=55, result=55, x=10] [L28] COND TRUE result == 55 VAL [result=55, x=10] [L29] CALL reach_error() [L4] __assert_fail("0", "fibo_10-1.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 24.1s, OverallIterations: 13, TraceHistogramMax: 177, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 475 SDtfs, 1236 SDslu, 697 SDs, 0 SdLazy, 2152 SolverSat, 852 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 862 GetRequests, 644 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1290occurred 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.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 177 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 4419 NumberOfCodeBlocks, 4419 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2831 ConstructedInterpolants, 0 QuantifiedInterpolants, 2185003 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 52171/63180 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...