/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/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 04:50:42,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 04:50:42,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 04:50:42,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 04:50:42,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 04:50:42,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 04:50:42,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 04:50:42,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 04:50:42,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 04:50:42,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 04:50:42,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 04:50:42,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 04:50:42,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 04:50:42,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 04:50:42,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 04:50:42,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 04:50:42,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 04:50:42,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 04:50:42,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 04:50:42,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 04:50:42,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 04:50:42,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 04:50:42,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 04:50:42,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 04:50:42,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 04:50:42,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 04:50:42,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 04:50:42,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 04:50:42,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 04:50:42,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 04:50:42,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 04:50:42,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 04:50:42,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 04:50:42,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 04:50:42,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 04:50:42,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 04:50:42,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 04:50:42,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 04:50:42,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 04:50:42,719 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 04:50:42,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 04:50:42,721 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:50:42,732 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 04:50:42,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 04:50:42,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 04:50:42,735 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 04:50:42,735 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 04:50:42,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 04:50:42,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 04:50:42,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 04:50:42,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 04:50:42,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 04:50:42,736 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 04:50:42,736 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 04:50:42,736 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 04:50:42,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 04:50:42,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 04:50:42,737 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 04:50:42,737 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 04:50:42,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 04:50:42,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 04:50:42,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 04:50:42,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 04:50:42,738 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 04:50:42,738 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:50:43,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 04:50:43,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 04:50:43,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 04:50:43,156 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 04:50:43,156 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 04:50:43,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-11-07 04:50:43,243 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c98e65c8/285d93225fc6425ab1b659f650731e69/FLAG0342f7f5f [2020-11-07 04:50:43,989 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 04:50:43,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-11-07 04:50:43,998 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c98e65c8/285d93225fc6425ab1b659f650731e69/FLAG0342f7f5f [2020-11-07 04:50:44,332 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c98e65c8/285d93225fc6425ab1b659f650731e69 [2020-11-07 04:50:44,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 04:50:44,344 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 04:50:44,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 04:50:44,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 04:50:44,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 04:50:44,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:50:44" (1/1) ... [2020-11-07 04:50:44,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c56eebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:44, skipping insertion in model container [2020-11-07 04:50:44,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:50:44" (1/1) ... [2020-11-07 04:50:44,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 04:50:44,381 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 04:50:44,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 04:50:44,563 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 04:50:44,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 04:50:44,604 INFO L208 MainTranslator]: Completed translation [2020-11-07 04:50:44,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:44 WrapperNode [2020-11-07 04:50:44,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 04:50:44,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 04:50:44,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 04:50:44,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 04:50:44,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:44" (1/1) ... [2020-11-07 04:50:44,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:44" (1/1) ... [2020-11-07 04:50:44,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:44" (1/1) ... [2020-11-07 04:50:44,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:44" (1/1) ... [2020-11-07 04:50:44,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:44" (1/1) ... [2020-11-07 04:50:44,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:44" (1/1) ... [2020-11-07 04:50:44,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:44" (1/1) ... [2020-11-07 04:50:44,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 04:50:44,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 04:50:44,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 04:50:44,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 04:50:44,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:44" (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:50:44,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 04:50:44,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 04:50:44,746 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 04:50:44,746 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-11-07 04:50:44,746 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 04:50:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 04:50:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 04:50:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 04:50:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 04:50:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 04:50:44,748 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-11-07 04:50:44,748 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 04:50:44,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 04:50:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 04:50:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 04:50:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 04:50:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 04:50:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 04:50:45,211 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 04:50:45,211 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 04:50:45,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:50:45 BoogieIcfgContainer [2020-11-07 04:50:45,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 04:50:45,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 04:50:45,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 04:50:45,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 04:50:45,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:50:44" (1/3) ... [2020-11-07 04:50:45,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267e4389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:50:45, skipping insertion in model container [2020-11-07 04:50:45,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:44" (2/3) ... [2020-11-07 04:50:45,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267e4389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:50:45, skipping insertion in model container [2020-11-07 04:50:45,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:50:45" (3/3) ... [2020-11-07 04:50:45,231 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-11-07 04:50:45,251 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 04:50:45,255 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 04:50:45,271 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 04:50:45,309 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 04:50:45,309 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 04:50:45,309 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 04:50:45,309 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 04:50:45,309 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 04:50:45,310 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 04:50:45,310 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 04:50:45,310 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 04:50:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-11-07 04:50:45,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-07 04:50:45,351 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:45,352 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, 1] [2020-11-07 04:50:45,352 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:45,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:45,363 INFO L82 PathProgramCache]: Analyzing trace with hash 496375619, now seen corresponding path program 1 times [2020-11-07 04:50:45,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:45,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1195357335] [2020-11-07 04:50:45,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:45,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:45,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 04:50:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:45,916 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:50:45,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1195357335] [2020-11-07 04:50:45,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:50:45,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 04:50:45,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15665135] [2020-11-07 04:50:45,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 04:50:45,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:45,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 04:50:45,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 04:50:45,946 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 6 states. [2020-11-07 04:50:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:46,346 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2020-11-07 04:50:46,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 04:50:46,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-11-07 04:50:46,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:46,361 INFO L225 Difference]: With dead ends: 61 [2020-11-07 04:50:46,362 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 04:50:46,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 04:50:46,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 04:50:46,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 04:50:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 04:50:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-11-07 04:50:46,435 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 27 [2020-11-07 04:50:46,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:46,436 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-07 04:50:46,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 04:50:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-11-07 04:50:46,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-07 04:50:46,441 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:46,442 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, 1, 1] [2020-11-07 04:50:46,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 04:50:46,443 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:46,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:46,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1977921721, now seen corresponding path program 1 times [2020-11-07 04:50:46,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:46,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1797078756] [2020-11-07 04:50:46,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:46,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:46,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 04:50:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:46,602 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:50:46,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1797078756] [2020-11-07 04:50:46,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:50:46,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 04:50:46,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991116390] [2020-11-07 04:50:46,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 04:50:46,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:46,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 04:50:46,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 04:50:46,606 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2020-11-07 04:50:47,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:47,043 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-11-07 04:50:47,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 04:50:47,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-11-07 04:50:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:47,047 INFO L225 Difference]: With dead ends: 48 [2020-11-07 04:50:47,048 INFO L226 Difference]: Without dead ends: 41 [2020-11-07 04:50:47,050 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 04:50:47,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-11-07 04:50:47,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2020-11-07 04:50:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 04:50:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-11-07 04:50:47,090 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 28 [2020-11-07 04:50:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:47,091 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-07 04:50:47,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 04:50:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-11-07 04:50:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-07 04:50:47,096 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:47,096 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, 1, 1] [2020-11-07 04:50:47,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 04:50:47,098 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:47,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:47,100 INFO L82 PathProgramCache]: Analyzing trace with hash -788452534, now seen corresponding path program 1 times [2020-11-07 04:50:47,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:47,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1197041881] [2020-11-07 04:50:47,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:47,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:47,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 04:50:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:47,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:47,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 04:50:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:47,379 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:50:47,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1197041881] [2020-11-07 04:50:47,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:47,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 04:50:47,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902320379] [2020-11-07 04:50:47,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 04:50:47,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:47,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 04:50:47,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 04:50:47,383 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2020-11-07 04:50:47,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:47,797 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2020-11-07 04:50:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 04:50:47,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2020-11-07 04:50:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:47,801 INFO L225 Difference]: With dead ends: 64 [2020-11-07 04:50:47,801 INFO L226 Difference]: Without dead ends: 41 [2020-11-07 04:50:47,804 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:50:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-11-07 04:50:47,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-11-07 04:50:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-07 04:50:47,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-11-07 04:50:47,827 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 44 [2020-11-07 04:50:47,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:47,831 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-11-07 04:50:47,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 04:50:47,831 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-11-07 04:50:47,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 04:50:47,835 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:47,835 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, 1, 1] [2020-11-07 04:50:47,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 04:50:47,836 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:47,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:47,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1354967602, now seen corresponding path program 1 times [2020-11-07 04:50:47,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:47,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [766610490] [2020-11-07 04:50:47,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:47,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:47,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 04:50:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,029 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:50:48,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [766610490] [2020-11-07 04:50:48,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:48,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 04:50:48,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677151140] [2020-11-07 04:50:48,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 04:50:48,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:48,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 04:50:48,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 04:50:48,033 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2020-11-07 04:50:48,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:48,532 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2020-11-07 04:50:48,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 04:50:48,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2020-11-07 04:50:48,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:48,539 INFO L225 Difference]: With dead ends: 68 [2020-11-07 04:50:48,540 INFO L226 Difference]: Without dead ends: 61 [2020-11-07 04:50:48,541 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:50:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-11-07 04:50:48,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-11-07 04:50:48,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-07 04:50:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-11-07 04:50:48,588 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 45 [2020-11-07 04:50:48,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:48,591 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-11-07 04:50:48,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 04:50:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-11-07 04:50:48,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-07 04:50:48,598 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:48,599 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, 1, 1] [2020-11-07 04:50:48,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 04:50:48,599 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:48,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:48,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2028047931, now seen corresponding path program 2 times [2020-11-07 04:50:48,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:48,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1283746313] [2020-11-07 04:50:48,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 04:50:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,804 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:50:48,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1283746313] [2020-11-07 04:50:48,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:48,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 04:50:48,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599197895] [2020-11-07 04:50:48,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 04:50:48,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:48,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 04:50:48,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 04:50:48,807 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 8 states. [2020-11-07 04:50:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:49,348 INFO L93 Difference]: Finished difference Result 120 states and 163 transitions. [2020-11-07 04:50:49,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 04:50:49,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2020-11-07 04:50:49,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:49,352 INFO L225 Difference]: With dead ends: 120 [2020-11-07 04:50:49,352 INFO L226 Difference]: Without dead ends: 75 [2020-11-07 04:50:49,354 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:50:49,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-11-07 04:50:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2020-11-07 04:50:49,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-07 04:50:49,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2020-11-07 04:50:49,378 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 62 [2020-11-07 04:50:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:49,378 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2020-11-07 04:50:49,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 04:50:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2020-11-07 04:50:49,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 04:50:49,381 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:49,381 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, 1, 1] [2020-11-07 04:50:49,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 04:50:49,382 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:49,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:49,382 INFO L82 PathProgramCache]: Analyzing trace with hash -64263789, now seen corresponding path program 3 times [2020-11-07 04:50:49,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:49,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1209915519] [2020-11-07 04:50:49,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:49,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:49,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 04:50:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:49,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:49,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:49,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:49,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:49,545 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:50:49,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1209915519] [2020-11-07 04:50:49,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:49,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 04:50:49,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391457586] [2020-11-07 04:50:49,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 04:50:49,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:49,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 04:50:49,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 04:50:49,548 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand 8 states. [2020-11-07 04:50:50,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:50,094 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2020-11-07 04:50:50,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 04:50:50,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2020-11-07 04:50:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:50,105 INFO L225 Difference]: With dead ends: 98 [2020-11-07 04:50:50,105 INFO L226 Difference]: Without dead ends: 91 [2020-11-07 04:50:50,109 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:50:50,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-11-07 04:50:50,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2020-11-07 04:50:50,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-11-07 04:50:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2020-11-07 04:50:50,162 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 63 [2020-11-07 04:50:50,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:50,165 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2020-11-07 04:50:50,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 04:50:50,166 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2020-11-07 04:50:50,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-07 04:50:50,173 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:50,174 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, 1, 1] [2020-11-07 04:50:50,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 04:50:50,175 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:50,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:50,176 INFO L82 PathProgramCache]: Analyzing trace with hash -143796757, now seen corresponding path program 4 times [2020-11-07 04:50:50,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:50,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [724751946] [2020-11-07 04:50:50,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 04:50:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:50:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:50:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,627 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:50:50,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [724751946] [2020-11-07 04:50:50,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:50,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 04:50:50,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594519138] [2020-11-07 04:50:50,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 04:50:50,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:50,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 04:50:50,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 04:50:50,632 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 9 states. [2020-11-07 04:50:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:51,325 INFO L93 Difference]: Finished difference Result 148 states and 201 transitions. [2020-11-07 04:50:51,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 04:50:51,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2020-11-07 04:50:51,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:51,335 INFO L225 Difference]: With dead ends: 148 [2020-11-07 04:50:51,335 INFO L226 Difference]: Without dead ends: 141 [2020-11-07 04:50:51,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-11-07 04:50:51,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-11-07 04:50:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 129. [2020-11-07 04:50:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-11-07 04:50:51,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 179 transitions. [2020-11-07 04:50:51,419 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 179 transitions. Word has length 134 [2020-11-07 04:50:51,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:51,420 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 179 transitions. [2020-11-07 04:50:51,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 04:50:51,421 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 179 transitions. [2020-11-07 04:50:51,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-11-07 04:50:51,427 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:51,427 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, 1, 1] [2020-11-07 04:50:51,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 04:50:51,428 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:51,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:51,428 INFO L82 PathProgramCache]: Analyzing trace with hash 91119029, now seen corresponding path program 5 times [2020-11-07 04:50:51,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:51,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1539592844] [2020-11-07 04:50:51,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 04:50:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:50:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:50:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:50:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:50:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:52,077 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:50:52,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1539592844] [2020-11-07 04:50:52,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:52,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 04:50:52,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816630510] [2020-11-07 04:50:52,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 04:50:52,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:52,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 04:50:52,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 04:50:52,080 INFO L87 Difference]: Start difference. First operand 129 states and 179 transitions. Second operand 10 states. [2020-11-07 04:50:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:52,930 INFO L93 Difference]: Finished difference Result 242 states and 350 transitions. [2020-11-07 04:50:52,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 04:50:52,930 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 204 [2020-11-07 04:50:52,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:52,937 INFO L225 Difference]: With dead ends: 242 [2020-11-07 04:50:52,937 INFO L226 Difference]: Without dead ends: 235 [2020-11-07 04:50:52,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2020-11-07 04:50:52,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-11-07 04:50:53,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 217. [2020-11-07 04:50:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-11-07 04:50:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2020-11-07 04:50:53,028 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 204 [2020-11-07 04:50:53,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:53,029 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2020-11-07 04:50:53,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 04:50:53,029 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2020-11-07 04:50:53,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2020-11-07 04:50:53,037 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:53,037 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 9, 6, 6, 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:50:53,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 04:50:53,038 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:53,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:53,038 INFO L82 PathProgramCache]: Analyzing trace with hash -108285303, now seen corresponding path program 6 times [2020-11-07 04:50:53,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:53,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2069099231] [2020-11-07 04:50:53,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 04:50:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:50:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:50:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 04:50:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:50:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:50:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 536 proven. 797 refuted. 0 times theorem prover too weak. 1232 trivial. 0 not checked. [2020-11-07 04:50:53,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2069099231] [2020-11-07 04:50:53,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:53,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 04:50:53,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938952857] [2020-11-07 04:50:53,992 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 04:50:53,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:53,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 04:50:53,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2020-11-07 04:50:53,998 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand 16 states. [2020-11-07 04:50:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:56,222 INFO L93 Difference]: Finished difference Result 332 states and 547 transitions. [2020-11-07 04:50:56,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 04:50:56,223 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 274 [2020-11-07 04:50:56,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:56,225 INFO L225 Difference]: With dead ends: 332 [2020-11-07 04:50:56,225 INFO L226 Difference]: Without dead ends: 126 [2020-11-07 04:50:56,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=349, Invalid=1291, Unknown=0, NotChecked=0, Total=1640 [2020-11-07 04:50:56,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-11-07 04:50:56,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 112. [2020-11-07 04:50:56,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-07 04:50:56,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2020-11-07 04:50:56,251 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 274 [2020-11-07 04:50:56,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:56,252 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2020-11-07 04:50:56,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 04:50:56,252 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2020-11-07 04:50:56,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2020-11-07 04:50:56,259 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:56,259 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:56,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 04:50:56,259 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:56,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:56,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1154543623, now seen corresponding path program 7 times [2020-11-07 04:50:56,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:56,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [880840852] [2020-11-07 04:50:56,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 04:50:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:50:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:50:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 04:50:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:50:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 04:50:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:50:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:50:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5244 backedges. 264 proven. 1364 refuted. 0 times theorem prover too weak. 3616 trivial. 0 not checked. [2020-11-07 04:50:57,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [880840852] [2020-11-07 04:50:57,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:57,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 04:50:57,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851885851] [2020-11-07 04:50:57,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 04:50:57,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:57,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 04:50:57,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-07 04:50:57,171 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand 12 states. [2020-11-07 04:50:58,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:58,184 INFO L93 Difference]: Finished difference Result 360 states and 492 transitions. [2020-11-07 04:50:58,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 04:50:58,185 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 380 [2020-11-07 04:50:58,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:58,192 INFO L225 Difference]: With dead ends: 360 [2020-11-07 04:50:58,192 INFO L226 Difference]: Without dead ends: 353 [2020-11-07 04:50:58,195 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=451, Unknown=0, NotChecked=0, Total=650 [2020-11-07 04:50:58,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-11-07 04:50:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 323. [2020-11-07 04:50:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-11-07 04:50:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 446 transitions. [2020-11-07 04:50:58,268 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 446 transitions. Word has length 380 [2020-11-07 04:50:58,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:58,270 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 446 transitions. [2020-11-07 04:50:58,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 04:50:58,270 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 446 transitions. [2020-11-07 04:50:58,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2020-11-07 04:50:58,293 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:58,294 INFO L422 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 26, 26, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:58,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 04:50:58,294 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:58,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:58,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1198075578, now seen corresponding path program 8 times [2020-11-07 04:50:58,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:58,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1671624925] [2020-11-07 04:50:58,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:58,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:58,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 04:50:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:58,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:50:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:50:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 04:50:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:50:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 04:50:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:50:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:50:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2020-11-07 04:50:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:51:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 04:51:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 04:51:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2020-11-07 04:51:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:51:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:51:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:51:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:00,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:51:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 22008 backedges. 3756 proven. 4212 refuted. 0 times theorem prover too weak. 14040 trivial. 0 not checked. [2020-11-07 04:51:01,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1671624925] [2020-11-07 04:51:01,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:51:01,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 04:51:01,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893537078] [2020-11-07 04:51:01,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 04:51:01,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:01,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 04:51:01,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2020-11-07 04:51:01,365 INFO L87 Difference]: Start difference. First operand 323 states and 446 transitions. Second operand 18 states. [2020-11-07 04:51:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:04,876 INFO L93 Difference]: Finished difference Result 483 states and 756 transitions. [2020-11-07 04:51:04,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-11-07 04:51:04,877 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 750 [2020-11-07 04:51:04,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:04,885 INFO L225 Difference]: With dead ends: 483 [2020-11-07 04:51:04,885 INFO L226 Difference]: Without dead ends: 176 [2020-11-07 04:51:04,891 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=734, Invalid=2572, Unknown=0, NotChecked=0, Total=3306 [2020-11-07 04:51:04,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-11-07 04:51:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 151. [2020-11-07 04:51:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-11-07 04:51:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 200 transitions. [2020-11-07 04:51:04,925 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 200 transitions. Word has length 750 [2020-11-07 04:51:04,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:04,929 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 200 transitions. [2020-11-07 04:51:04,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 04:51:04,929 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 200 transitions. [2020-11-07 04:51:04,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2020-11-07 04:51:04,950 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:04,950 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, 1, 1] [2020-11-07 04:51:04,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 04:51:04,951 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:04,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:04,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1341419694, now seen corresponding path program 9 times [2020-11-07 04:51:04,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:04,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1871587929] [2020-11-07 04:51:04,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 04:51:05,046 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 04:51:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 04:51:05,135 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 04:51:05,355 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 04:51:05,355 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 04:51:05,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 04:51:05,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:51:05 BoogieIcfgContainer [2020-11-07 04:51:05,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 04:51:05,581 INFO L168 Benchmark]: Toolchain (without parser) took 21241.89 ms. Allocated memory was 155.2 MB in the beginning and 576.7 MB in the end (delta: 421.5 MB). Free memory was 131.5 MB in the beginning and 401.3 MB in the end (delta: -269.7 MB). Peak memory consumption was 152.5 MB. Max. memory is 8.0 GB. [2020-11-07 04:51:05,582 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 125.8 MB. Free memory is still 97.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 04:51:05,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.04 ms. Allocated memory is still 155.2 MB. Free memory was 130.9 MB in the beginning and 121.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 04:51:05,590 INFO L168 Benchmark]: Boogie Preprocessor took 40.30 ms. Allocated memory is still 155.2 MB. Free memory was 121.6 MB in the beginning and 120.4 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:51:05,591 INFO L168 Benchmark]: RCFGBuilder took 567.32 ms. Allocated memory is still 155.2 MB. Free memory was 120.2 MB in the beginning and 137.1 MB in the end (delta: -16.9 MB). Peak memory consumption was 16.1 MB. Max. memory is 8.0 GB. [2020-11-07 04:51:05,592 INFO L168 Benchmark]: TraceAbstraction took 20357.90 ms. Allocated memory was 155.2 MB in the beginning and 576.7 MB in the end (delta: 421.5 MB). Free memory was 136.7 MB in the beginning and 401.3 MB in the end (delta: -264.6 MB). Peak memory consumption was 156.3 MB. Max. memory is 8.0 GB. [2020-11-07 04:51:05,596 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.23 ms. Allocated memory is still 125.8 MB. Free memory is still 97.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 260.04 ms. Allocated memory is still 155.2 MB. Free memory was 130.9 MB in the beginning and 121.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 40.30 ms. Allocated memory is still 155.2 MB. Free memory was 121.6 MB in the beginning and 120.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 567.32 ms. Allocated memory is still 155.2 MB. Free memory was 120.2 MB in the beginning and 137.1 MB in the end (delta: -16.9 MB). Peak memory consumption was 16.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 20357.90 ms. Allocated memory was 155.2 MB in the beginning and 576.7 MB in the end (delta: 421.5 MB). Free memory was 136.7 MB in the beginning and 401.3 MB in the end (delta: -264.6 MB). Peak memory consumption was 156.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=8, x=8] [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=5, \result=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=6, \result=8, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=5, \result=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=7, \result=13, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=5, \result=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=6, \result=8, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=8, \result=21, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L29] int result = fibonacci(x); VAL [fibonacci(x)=21, result=21, x=8] [L30] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L33] CALL reach_error() [L3] __assert_fail("0", "Fibonacci05.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.0s, OverallIterations: 12, TraceHistogramMax: 83, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 472 SDtfs, 1186 SDslu, 690 SDs, 0 SdLazy, 2219 SolverSat, 750 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 660 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=323occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 119 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 2620 NumberOfCodeBlocks, 2620 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2000 ConstructedInterpolants, 0 QuantifiedInterpolants, 1300036 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 24682/31749 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...