/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_VARIABLES --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-20 16:34:16,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 16:34:16,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 16:34:16,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 16:34:16,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 16:34:16,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 16:34:16,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 16:34:16,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 16:34:16,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 16:34:16,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 16:34:16,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 16:34:16,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 16:34:16,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 16:34:16,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 16:34:16,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 16:34:16,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 16:34:16,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 16:34:16,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 16:34:16,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 16:34:16,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 16:34:16,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 16:34:16,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 16:34:16,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 16:34:16,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 16:34:16,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 16:34:16,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 16:34:16,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 16:34:16,774 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 16:34:16,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 16:34:16,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 16:34:16,776 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 16:34:16,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 16:34:16,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 16:34:16,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 16:34:16,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 16:34:16,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 16:34:16,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 16:34:16,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 16:34:16,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 16:34:16,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 16:34:16,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 16:34:16,792 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 16:34:16,819 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 16:34:16,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 16:34:16,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 16:34:16,822 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 16:34:16,822 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 16:34:16,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 16:34:16,823 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 16:34:16,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 16:34:16,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 16:34:16,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 16:34:16,825 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 16:34:16,825 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 16:34:16,825 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 16:34:16,826 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 16:34:16,826 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 16:34:16,826 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 16:34:16,827 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 16:34:16,827 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 16:34:16,827 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 16:34:16,827 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 16:34:16,827 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 16:34:16,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 16:34:16,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 16:34:16,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 16:34:16,828 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 16:34:16,828 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 16:34:16,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:16,829 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 16:34:16,829 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 16:34:16,829 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_VARIABLES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-20 16:34:17,133 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 16:34:17,149 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 16:34:17,153 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 16:34:17,154 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 16:34:17,155 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 16:34:17,155 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-07-20 16:34:17,226 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e778795e/bc07e215a79f44559853b7bb1ce5aa27/FLAGe12e1677b [2020-07-20 16:34:17,754 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 16:34:17,754 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-07-20 16:34:17,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e778795e/bc07e215a79f44559853b7bb1ce5aa27/FLAGe12e1677b [2020-07-20 16:34:18,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e778795e/bc07e215a79f44559853b7bb1ce5aa27 [2020-07-20 16:34:18,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 16:34:18,108 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 16:34:18,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 16:34:18,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 16:34:18,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 16:34:18,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:34:18" (1/1) ... [2020-07-20 16:34:18,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62a47b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:34:18, skipping insertion in model container [2020-07-20 16:34:18,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:34:18" (1/1) ... [2020-07-20 16:34:18,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 16:34:18,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 16:34:18,320 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 16:34:18,324 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 16:34:18,338 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 16:34:18,351 INFO L208 MainTranslator]: Completed translation [2020-07-20 16:34:18,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:34:18 WrapperNode [2020-07-20 16:34:18,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 16:34:18,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 16:34:18,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 16:34:18,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 16:34:18,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:34:18" (1/1) ... [2020-07-20 16:34:18,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:34:18" (1/1) ... [2020-07-20 16:34:18,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:34:18" (1/1) ... [2020-07-20 16:34:18,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:34:18" (1/1) ... [2020-07-20 16:34:18,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:34:18" (1/1) ... [2020-07-20 16:34:18,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:34:18" (1/1) ... [2020-07-20 16:34:18,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:34:18" (1/1) ... [2020-07-20 16:34:18,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 16:34:18,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 16:34:18,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 16:34:18,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 16:34:18,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:34:18" (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-07-20 16:34:18,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 16:34:18,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 16:34:18,532 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-20 16:34:18,532 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 16:34:18,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 16:34:18,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 16:34:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-20 16:34:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 16:34:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 16:34:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 16:34:18,739 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 16:34:18,739 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-20 16:34:18,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:34:18 BoogieIcfgContainer [2020-07-20 16:34:18,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 16:34:18,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 16:34:18,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 16:34:18,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 16:34:18,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 04:34:18" (1/3) ... [2020-07-20 16:34:18,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c5597b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:34:18, skipping insertion in model container [2020-07-20 16:34:18,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:34:18" (2/3) ... [2020-07-20 16:34:18,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c5597b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:34:18, skipping insertion in model container [2020-07-20 16:34:18,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:34:18" (3/3) ... [2020-07-20 16:34:18,754 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-07-20 16:34:18,767 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 16:34:18,777 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 16:34:18,801 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 16:34:18,839 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 16:34:18,840 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 16:34:18,840 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 16:34:18,840 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 16:34:18,840 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 16:34:18,841 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 16:34:18,841 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 16:34:18,841 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 16:34:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-20 16:34:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-20 16:34:18,880 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 16:34:18,882 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 16:34:18,882 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 16:34:18,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 16:34:18,891 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-07-20 16:34:18,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 16:34:18,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1268761710] [2020-07-20 16:34:18,903 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:18,999 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 16:34:18,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 16:34:19,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 16:34:19,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 16:34:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 16:34:19,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 16:34:19,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1268761710] [2020-07-20 16:34:19,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 16:34:19,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 16:34:19,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704379527] [2020-07-20 16:34:19,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 16:34:19,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 16:34:19,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 16:34:19,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 16:34:19,136 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-07-20 16:34:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 16:34:19,255 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-20 16:34:19,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 16:34:19,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-20 16:34:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 16:34:19,270 INFO L225 Difference]: With dead ends: 35 [2020-07-20 16:34:19,270 INFO L226 Difference]: Without dead ends: 21 [2020-07-20 16:34:19,275 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 16:34:19,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-20 16:34:19,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-20 16:34:19,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 16:34:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 16:34:19,329 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-20 16:34:19,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 16:34:19,329 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 16:34:19,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 16:34:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 16:34:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-20 16:34:19,333 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 16:34:19,333 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 16:34:19,539 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:19,540 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 16:34:19,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 16:34:19,541 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-07-20 16:34:19,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 16:34:19,542 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1275079947] [2020-07-20 16:34:19,543 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:19,570 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 16:34:19,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 16:34:19,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 16:34:19,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 16:34:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 16:34:19,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 16:34:19,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1275079947] [2020-07-20 16:34:19,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 16:34:19,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 16:34:19,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471029581] [2020-07-20 16:34:19,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 16:34:19,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 16:34:19,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 16:34:19,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 16:34:19,615 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-20 16:34:19,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 16:34:19,683 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-20 16:34:19,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 16:34:19,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-20 16:34:19,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 16:34:19,686 INFO L225 Difference]: With dead ends: 27 [2020-07-20 16:34:19,686 INFO L226 Difference]: Without dead ends: 23 [2020-07-20 16:34:19,688 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 16:34:19,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-20 16:34:19,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-20 16:34:19,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 16:34:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 16:34:19,697 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-20 16:34:19,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 16:34:19,698 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 16:34:19,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 16:34:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 16:34:19,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 16:34:19,700 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 16:34:19,700 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 16:34:19,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:19,914 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 16:34:19,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 16:34:19,916 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-07-20 16:34:19,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 16:34:19,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1518341085] [2020-07-20 16:34:19,917 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:19,958 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 16:34:19,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 16:34:19,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 16:34:19,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 16:34:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-20 16:34:20,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 16:34:20,321 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-20 16:34:20,389 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1518341085] [2020-07-20 16:34:20,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 16:34:20,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-20 16:34:20,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641490506] [2020-07-20 16:34:20,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 16:34:20,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 16:34:20,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 16:34:20,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 16:34:20,397 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-20 16:34:20,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 16:34:20,511 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-20 16:34:20,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 16:34:20,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-20 16:34:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 16:34:20,514 INFO L225 Difference]: With dead ends: 32 [2020-07-20 16:34:20,514 INFO L226 Difference]: Without dead ends: 28 [2020-07-20 16:34:20,515 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-20 16:34:20,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-20 16:34:20,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-20 16:34:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-20 16:34:20,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-20 16:34:20,525 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 26 [2020-07-20 16:34:20,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 16:34:20,526 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-20 16:34:20,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 16:34:20,526 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-20 16:34:20,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-20 16:34:20,528 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 16:34:20,528 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 16:34:20,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:20,743 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 16:34:20,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 16:34:20,744 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-07-20 16:34:20,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 16:34:20,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [637889570] [2020-07-20 16:34:20,745 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:20,781 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 16:34:20,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 16:34:20,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 16:34:20,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 16:34:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-20 16:34:20,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 16:34:20,998 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:21,032 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-20 16:34:21,032 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [637889570] [2020-07-20 16:34:21,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 16:34:21,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-20 16:34:21,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414746338] [2020-07-20 16:34:21,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 16:34:21,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 16:34:21,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 16:34:21,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 16:34:21,035 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 9 states. [2020-07-20 16:34:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 16:34:21,125 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2020-07-20 16:34:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 16:34:21,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-20 16:34:21,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 16:34:21,128 INFO L225 Difference]: With dead ends: 37 [2020-07-20 16:34:21,128 INFO L226 Difference]: Without dead ends: 33 [2020-07-20 16:34:21,129 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-20 16:34:21,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-20 16:34:21,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2020-07-20 16:34:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-20 16:34:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-20 16:34:21,140 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 27 [2020-07-20 16:34:21,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 16:34:21,140 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-20 16:34:21,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 16:34:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-20 16:34:21,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-20 16:34:21,143 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 16:34:21,143 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 16:34:21,357 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:21,358 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 16:34:21,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 16:34:21,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2027372739, now seen corresponding path program 2 times [2020-07-20 16:34:21,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 16:34:21,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [961151952] [2020-07-20 16:34:21,359 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:21,413 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 16:34:21,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 16:34:21,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 16:34:21,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 16:34:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-20 16:34:21,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 16:34:21,724 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:21,726 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:21,779 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:21,780 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-20 16:34:21,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [961151952] [2020-07-20 16:34:21,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 16:34:21,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-20 16:34:21,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266676555] [2020-07-20 16:34:21,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 16:34:21,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 16:34:21,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 16:34:21,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-20 16:34:21,822 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 11 states. [2020-07-20 16:34:22,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 16:34:22,006 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2020-07-20 16:34:22,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 16:34:22,006 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-20 16:34:22,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 16:34:22,009 INFO L225 Difference]: With dead ends: 42 [2020-07-20 16:34:22,010 INFO L226 Difference]: Without dead ends: 38 [2020-07-20 16:34:22,011 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-20 16:34:22,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-20 16:34:22,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2020-07-20 16:34:22,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-20 16:34:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-20 16:34:22,021 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 39 [2020-07-20 16:34:22,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 16:34:22,022 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-20 16:34:22,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 16:34:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-20 16:34:22,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-20 16:34:22,024 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 16:34:22,024 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 16:34:22,228 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:22,229 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 16:34:22,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 16:34:22,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 2 times [2020-07-20 16:34:22,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 16:34:22,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1994421359] [2020-07-20 16:34:22,232 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:22,266 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 16:34:22,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 16:34:22,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 16:34:22,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 16:34:22,308 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 16:34:22,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 16:34:22,557 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:22,622 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:22,629 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-20 16:34:22,675 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1994421359] [2020-07-20 16:34:22,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 16:34:22,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-20 16:34:22,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332074559] [2020-07-20 16:34:22,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 16:34:22,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 16:34:22,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 16:34:22,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-20 16:34:22,677 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 11 states. [2020-07-20 16:34:22,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 16:34:22,829 INFO L93 Difference]: Finished difference Result 47 states and 84 transitions. [2020-07-20 16:34:22,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 16:34:22,830 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2020-07-20 16:34:22,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 16:34:22,833 INFO L225 Difference]: With dead ends: 47 [2020-07-20 16:34:22,833 INFO L226 Difference]: Without dead ends: 43 [2020-07-20 16:34:22,834 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-20 16:34:22,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-20 16:34:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2020-07-20 16:34:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-20 16:34:22,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-20 16:34:22,846 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 41 [2020-07-20 16:34:22,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 16:34:22,847 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-20 16:34:22,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 16:34:22,847 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-20 16:34:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-20 16:34:22,849 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 16:34:22,850 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 16:34:23,052 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:23,054 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 16:34:23,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 16:34:23,054 INFO L82 PathProgramCache]: Analyzing trace with hash -767819153, now seen corresponding path program 3 times [2020-07-20 16:34:23,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 16:34:23,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [481829055] [2020-07-20 16:34:23,056 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:23,100 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 16:34:23,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 16:34:23,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 16:34:23,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 16:34:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 17 proven. 79 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-07-20 16:34:23,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 16:34:23,623 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:23,734 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:23,738 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:23,791 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:23,792 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-07-20 16:34:23,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [481829055] [2020-07-20 16:34:23,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 16:34:23,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-20 16:34:23,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006496115] [2020-07-20 16:34:23,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 16:34:23,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 16:34:23,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 16:34:23,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-20 16:34:23,839 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 13 states. [2020-07-20 16:34:24,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 16:34:24,065 INFO L93 Difference]: Finished difference Result 52 states and 102 transitions. [2020-07-20 16:34:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 16:34:24,065 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2020-07-20 16:34:24,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 16:34:24,068 INFO L225 Difference]: With dead ends: 52 [2020-07-20 16:34:24,068 INFO L226 Difference]: Without dead ends: 48 [2020-07-20 16:34:24,070 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 111 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-07-20 16:34:24,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-20 16:34:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-07-20 16:34:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-20 16:34:24,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-20 16:34:24,082 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 65 [2020-07-20 16:34:24,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 16:34:24,083 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-20 16:34:24,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 16:34:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-20 16:34:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-20 16:34:24,086 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 16:34:24,086 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 16:34:24,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:24,292 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 16:34:24,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 16:34:24,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 3 times [2020-07-20 16:34:24,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 16:34:24,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2104964832] [2020-07-20 16:34:24,294 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:24,345 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 16:34:24,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 16:34:24,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-20 16:34:24,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 16:34:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 115 proven. 171 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2020-07-20 16:34:24,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 16:34:25,203 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:25,291 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:25,355 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:25,650 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:25,651 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:25,717 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:25,766 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 115 proven. 193 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2020-07-20 16:34:25,766 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2104964832] [2020-07-20 16:34:25,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 16:34:25,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 21 [2020-07-20 16:34:25,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090325456] [2020-07-20 16:34:25,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-20 16:34:25,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 16:34:25,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-20 16:34:25,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-07-20 16:34:25,769 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 21 states. [2020-07-20 16:34:26,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 16:34:26,364 INFO L93 Difference]: Finished difference Result 94 states and 184 transitions. [2020-07-20 16:34:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-20 16:34:26,365 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 96 [2020-07-20 16:34:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 16:34:26,367 INFO L225 Difference]: With dead ends: 94 [2020-07-20 16:34:26,367 INFO L226 Difference]: Without dead ends: 64 [2020-07-20 16:34:26,370 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 164 SyntacticMatches, 13 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=981, Unknown=0, NotChecked=0, Total=1332 [2020-07-20 16:34:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-20 16:34:26,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2020-07-20 16:34:26,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-20 16:34:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2020-07-20 16:34:26,382 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 96 [2020-07-20 16:34:26,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 16:34:26,382 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2020-07-20 16:34:26,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-20 16:34:26,383 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2020-07-20 16:34:26,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-20 16:34:26,385 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 16:34:26,385 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 16:34:26,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:26,599 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 16:34:26,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 16:34:26,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2001184551, now seen corresponding path program 4 times [2020-07-20 16:34:26,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 16:34:26,601 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1220429601] [2020-07-20 16:34:26,601 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:26,654 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 16:34:26,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 16:34:26,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 16:34:26,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 16:34:26,724 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-20 16:34:26,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 16:34:27,104 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:27,194 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:27,249 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:27,288 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 103 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-07-20 16:34:27,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1220429601] [2020-07-20 16:34:27,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 16:34:27,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-20 16:34:27,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394948495] [2020-07-20 16:34:27,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 16:34:27,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 16:34:27,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 16:34:27,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-20 16:34:27,291 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand 13 states. [2020-07-20 16:34:27,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 16:34:27,434 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2020-07-20 16:34:27,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 16:34:27,435 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2020-07-20 16:34:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 16:34:27,437 INFO L225 Difference]: With dead ends: 65 [2020-07-20 16:34:27,437 INFO L226 Difference]: Without dead ends: 61 [2020-07-20 16:34:27,438 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 116 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-07-20 16:34:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-20 16:34:27,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-07-20 16:34:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-20 16:34:27,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2020-07-20 16:34:27,455 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 68 [2020-07-20 16:34:27,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 16:34:27,456 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2020-07-20 16:34:27,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 16:34:27,457 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2020-07-20 16:34:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-07-20 16:34:27,460 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 16:34:27,460 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 16:34:27,674 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:27,675 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 16:34:27,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 16:34:27,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1200034344, now seen corresponding path program 5 times [2020-07-20 16:34:27,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 16:34:27,677 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [421271235] [2020-07-20 16:34:27,677 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:27,761 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 16:34:27,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 16:34:27,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 16:34:27,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 16:34:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-07-20 16:34:27,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 16:34:28,454 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:28,627 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:28,629 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:28,719 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:28,769 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 255 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2020-07-20 16:34:28,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [421271235] [2020-07-20 16:34:28,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 16:34:28,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-20 16:34:28,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139831701] [2020-07-20 16:34:28,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-20 16:34:28,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 16:34:28,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-20 16:34:28,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-20 16:34:28,809 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 15 states. [2020-07-20 16:34:28,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 16:34:28,988 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2020-07-20 16:34:28,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 16:34:28,989 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 109 [2020-07-20 16:34:28,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 16:34:28,994 INFO L225 Difference]: With dead ends: 68 [2020-07-20 16:34:28,994 INFO L226 Difference]: Without dead ends: 64 [2020-07-20 16:34:28,995 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 194 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-07-20 16:34:28,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-20 16:34:29,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-07-20 16:34:29,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-20 16:34:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2020-07-20 16:34:29,021 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 109 [2020-07-20 16:34:29,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 16:34:29,023 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2020-07-20 16:34:29,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-20 16:34:29,023 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2020-07-20 16:34:29,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-07-20 16:34:29,031 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 16:34:29,032 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 16:34:29,232 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:29,233 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 16:34:29,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 16:34:29,233 INFO L82 PathProgramCache]: Analyzing trace with hash 706081956, now seen corresponding path program 6 times [2020-07-20 16:34:29,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 16:34:29,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1470292444] [2020-07-20 16:34:29,234 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:29,325 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 16:34:29,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 16:34:29,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-20 16:34:29,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 16:34:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 463 proven. 839 refuted. 0 times theorem prover too weak. 1278 trivial. 0 not checked. [2020-07-20 16:34:29,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 16:34:30,786 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:30,956 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:31,052 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:31,108 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:31,109 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:31,742 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:31,743 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:31,904 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:32,026 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:32,074 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:32,075 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 463 proven. 891 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked. [2020-07-20 16:34:32,137 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1470292444] [2020-07-20 16:34:32,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 16:34:32,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23] total 25 [2020-07-20 16:34:32,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230011033] [2020-07-20 16:34:32,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-20 16:34:32,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 16:34:32,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-20 16:34:32,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2020-07-20 16:34:32,140 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand 25 states. [2020-07-20 16:34:32,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 16:34:32,937 INFO L93 Difference]: Finished difference Result 144 states and 221 transitions. [2020-07-20 16:34:32,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-20 16:34:32,938 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 218 [2020-07-20 16:34:32,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 16:34:32,941 INFO L225 Difference]: With dead ends: 144 [2020-07-20 16:34:32,941 INFO L226 Difference]: Without dead ends: 88 [2020-07-20 16:34:32,943 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 391 SyntacticMatches, 21 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=539, Invalid=1531, Unknown=0, NotChecked=0, Total=2070 [2020-07-20 16:34:32,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-20 16:34:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2020-07-20 16:34:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-20 16:34:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2020-07-20 16:34:32,956 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 218 [2020-07-20 16:34:32,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 16:34:32,957 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2020-07-20 16:34:32,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-20 16:34:32,957 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2020-07-20 16:34:32,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-07-20 16:34:32,959 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 16:34:32,960 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 16:34:33,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:33,175 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 16:34:33,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 16:34:33,176 INFO L82 PathProgramCache]: Analyzing trace with hash 259499213, now seen corresponding path program 7 times [2020-07-20 16:34:33,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 16:34:33,177 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [705317855] [2020-07-20 16:34:33,177 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:33,299 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 16:34:33,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 16:34:33,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 16:34:33,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 16:34:33,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-07-20 16:34:33,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 16:34:34,406 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:34,407 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:34,665 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:34,840 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:34,841 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:34,929 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:34,976 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 573 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2020-07-20 16:34:35,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [705317855] [2020-07-20 16:34:35,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 16:34:35,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2020-07-20 16:34:35,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420829838] [2020-07-20 16:34:35,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-20 16:34:35,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 16:34:35,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-20 16:34:35,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-20 16:34:35,044 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand 17 states. [2020-07-20 16:34:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 16:34:35,254 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2020-07-20 16:34:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 16:34:35,254 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 177 [2020-07-20 16:34:35,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 16:34:35,256 INFO L225 Difference]: With dead ends: 85 [2020-07-20 16:34:35,257 INFO L226 Difference]: Without dead ends: 81 [2020-07-20 16:34:35,257 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 326 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2020-07-20 16:34:35,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-20 16:34:35,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-07-20 16:34:35,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-20 16:34:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 107 transitions. [2020-07-20 16:34:35,267 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 107 transitions. Word has length 177 [2020-07-20 16:34:35,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 16:34:35,268 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 107 transitions. [2020-07-20 16:34:35,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-20 16:34:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2020-07-20 16:34:35,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-20 16:34:35,273 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 16:34:35,273 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 16:34:35,486 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:35,487 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 16:34:35,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 16:34:35,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1425621089, now seen corresponding path program 8 times [2020-07-20 16:34:35,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 16:34:35,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [704703330] [2020-07-20 16:34:35,488 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:35,642 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 16:34:35,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 16:34:35,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-20 16:34:35,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 16:34:35,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-07-20 16:34:35,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 16:34:37,387 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:37,388 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:37,836 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:38,102 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:38,103 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:38,261 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:38,354 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:38,405 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1187 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2020-07-20 16:34:38,497 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [704703330] [2020-07-20 16:34:38,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 16:34:38,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 19 [2020-07-20 16:34:38,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026034409] [2020-07-20 16:34:38,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-20 16:34:38,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 16:34:38,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-20 16:34:38,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-07-20 16:34:38,499 INFO L87 Difference]: Start difference. First operand 81 states and 107 transitions. Second operand 19 states. [2020-07-20 16:34:38,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 16:34:38,824 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2020-07-20 16:34:38,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 16:34:38,825 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 286 [2020-07-20 16:34:38,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 16:34:38,827 INFO L225 Difference]: With dead ends: 90 [2020-07-20 16:34:38,827 INFO L226 Difference]: Without dead ends: 86 [2020-07-20 16:34:38,828 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 540 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2020-07-20 16:34:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-20 16:34:38,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-07-20 16:34:38,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-07-20 16:34:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2020-07-20 16:34:38,851 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 120 transitions. Word has length 286 [2020-07-20 16:34:38,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 16:34:38,855 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 120 transitions. [2020-07-20 16:34:38,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-20 16:34:38,856 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2020-07-20 16:34:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2020-07-20 16:34:38,861 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 16:34:38,862 INFO L422 BasicCegarLoop]: trace histogram [73, 73, 59, 36, 36, 36, 36, 36, 36, 36, 23, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 16:34:39,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:39,072 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 16:34:39,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 16:34:39,073 INFO L82 PathProgramCache]: Analyzing trace with hash -350328107, now seen corresponding path program 9 times [2020-07-20 16:34:39,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 16:34:39,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1008846344] [2020-07-20 16:34:39,074 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:39,280 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 16:34:39,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 16:34:39,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-20 16:34:39,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 16:34:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 14743 backedges. 7742 proven. 1596 refuted. 0 times theorem prover too weak. 5405 trivial. 0 not checked. [2020-07-20 16:34:39,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 16:34:42,825 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:43,122 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:43,123 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:43,304 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:43,405 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:43,406 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:43,464 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:43,465 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:44,487 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:44,488 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:44,769 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:44,770 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:44,946 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:44,947 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:45,049 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:45,050 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:45,107 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 14743 backedges. 1220 proven. 3406 refuted. 0 times theorem prover too weak. 10117 trivial. 0 not checked. [2020-07-20 16:34:45,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1008846344] [2020-07-20 16:34:45,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 16:34:45,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 27] total 29 [2020-07-20 16:34:45,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631922416] [2020-07-20 16:34:45,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-07-20 16:34:45,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 16:34:45,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-07-20 16:34:45,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2020-07-20 16:34:45,293 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand 29 states. [2020-07-20 16:34:46,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 16:34:46,631 INFO L93 Difference]: Finished difference Result 187 states and 314 transitions. [2020-07-20 16:34:46,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-07-20 16:34:46,633 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 504 [2020-07-20 16:34:46,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 16:34:46,635 INFO L225 Difference]: With dead ends: 187 [2020-07-20 16:34:46,636 INFO L226 Difference]: Without dead ends: 109 [2020-07-20 16:34:46,640 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1033 GetRequests, 955 SyntacticMatches, 25 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=747, Invalid=2223, Unknown=0, NotChecked=0, Total=2970 [2020-07-20 16:34:46,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-20 16:34:46,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2020-07-20 16:34:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-20 16:34:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2020-07-20 16:34:46,671 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 504 [2020-07-20 16:34:46,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 16:34:46,672 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2020-07-20 16:34:46,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-07-20 16:34:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2020-07-20 16:34:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-07-20 16:34:46,679 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 16:34:46,679 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 16:34:46,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:46,895 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 16:34:46,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 16:34:46,896 INFO L82 PathProgramCache]: Analyzing trace with hash -229001048, now seen corresponding path program 10 times [2020-07-20 16:34:46,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 16:34:46,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [545057610] [2020-07-20 16:34:46,896 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:47,163 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 16:34:47,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 16:34:47,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-20 16:34:47,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 16:34:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2270 refuted. 0 times theorem prover too weak. 9756 trivial. 0 not checked. [2020-07-20 16:34:47,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 16:34:49,701 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:49,702 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:50,459 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:50,460 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:50,905 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:50,905 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:51,179 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:51,365 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:51,463 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:51,464 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:51,516 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:51,517 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2347 refuted. 0 times theorem prover too weak. 9679 trivial. 0 not checked. [2020-07-20 16:34:51,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [545057610] [2020-07-20 16:34:51,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 16:34:51,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 21 [2020-07-20 16:34:51,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556577510] [2020-07-20 16:34:51,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-20 16:34:51,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 16:34:51,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-20 16:34:51,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-07-20 16:34:51,671 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand 21 states. [2020-07-20 16:34:52,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 16:34:52,015 INFO L93 Difference]: Finished difference Result 107 states and 153 transitions. [2020-07-20 16:34:52,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 16:34:52,017 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 463 [2020-07-20 16:34:52,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 16:34:52,020 INFO L225 Difference]: With dead ends: 107 [2020-07-20 16:34:52,020 INFO L226 Difference]: Without dead ends: 103 [2020-07-20 16:34:52,021 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 933 GetRequests, 890 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2020-07-20 16:34:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-20 16:34:52,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-07-20 16:34:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-07-20 16:34:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2020-07-20 16:34:52,034 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 463 [2020-07-20 16:34:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 16:34:52,036 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2020-07-20 16:34:52,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-20 16:34:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2020-07-20 16:34:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2020-07-20 16:34:52,046 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 16:34:52,046 INFO L422 BasicCegarLoop]: trace histogram [145, 145, 117, 72, 72, 72, 72, 72, 72, 72, 45, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 16:34:52,247 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:52,247 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 16:34:52,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 16:34:52,248 INFO L82 PathProgramCache]: Analyzing trace with hash -928557949, now seen corresponding path program 11 times [2020-07-20 16:34:52,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 16:34:52,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1634157557] [2020-07-20 16:34:52,249 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:34:52,561 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 16:34:52,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 16:34:52,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 32 conjunts are in the unsatisfiable core [2020-07-20 16:34:52,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 16:34:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 58770 backedges. 29376 proven. 4650 refuted. 0 times theorem prover too weak. 24744 trivial. 0 not checked. [2020-07-20 16:34:53,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 16:34:59,802 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:34:59,803 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:00,503 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:00,982 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:00,983 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:01,279 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:01,467 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:01,580 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:01,645 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:03,485 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:03,486 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:03,986 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:03,987 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:04,289 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:04,290 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:04,489 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:04,606 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:04,671 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:04,672 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 58770 backedges. 2815 proven. 9221 refuted. 0 times theorem prover too weak. 46734 trivial. 0 not checked. [2020-07-20 16:35:05,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1634157557] [2020-07-20 16:35:05,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 16:35:05,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 33] total 37 [2020-07-20 16:35:05,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417035050] [2020-07-20 16:35:05,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-07-20 16:35:05,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 16:35:05,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-07-20 16:35:05,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1124, Unknown=0, NotChecked=0, Total=1332 [2020-07-20 16:35:05,192 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand 37 states. [2020-07-20 16:35:07,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 16:35:07,379 INFO L93 Difference]: Finished difference Result 257 states and 498 transitions. [2020-07-20 16:35:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-07-20 16:35:07,380 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 994 [2020-07-20 16:35:07,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 16:35:07,385 INFO L225 Difference]: With dead ends: 257 [2020-07-20 16:35:07,385 INFO L226 Difference]: Without dead ends: 162 [2020-07-20 16:35:07,389 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2023 GetRequests, 1923 SyntacticMatches, 29 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1231, Invalid=4025, Unknown=0, NotChecked=0, Total=5256 [2020-07-20 16:35:07,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-07-20 16:35:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 129. [2020-07-20 16:35:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-07-20 16:35:07,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 186 transitions. [2020-07-20 16:35:07,413 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 186 transitions. Word has length 994 [2020-07-20 16:35:07,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 16:35:07,414 INFO L479 AbstractCegarLoop]: Abstraction has 129 states and 186 transitions. [2020-07-20 16:35:07,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-07-20 16:35:07,414 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 186 transitions. [2020-07-20 16:35:07,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2020-07-20 16:35:07,420 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 16:35:07,421 INFO L422 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 16:35:07,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:35:07,634 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 16:35:07,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 16:35:07,634 INFO L82 PathProgramCache]: Analyzing trace with hash -127293739, now seen corresponding path program 12 times [2020-07-20 16:35:07,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 16:35:07,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1772617442] [2020-07-20 16:35:07,635 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:35:08,127 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 16:35:08,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 16:35:08,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-20 16:35:08,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 16:35:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2020-07-20 16:35:08,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 16:35:12,210 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:13,495 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:14,301 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:14,801 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:14,802 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:15,103 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:15,104 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:15,320 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:15,425 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:15,484 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 16:35:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4480 refuted. 0 times theorem prover too weak. 27957 trivial. 0 not checked. [2020-07-20 16:35:15,728 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1772617442] [2020-07-20 16:35:15,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 16:35:15,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 22 [2020-07-20 16:35:15,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572543252] [2020-07-20 16:35:15,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-20 16:35:15,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 16:35:15,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-20 16:35:15,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-07-20 16:35:15,731 INFO L87 Difference]: Start difference. First operand 129 states and 186 transitions. Second operand 22 states. [2020-07-20 16:35:16,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 16:35:16,036 INFO L93 Difference]: Finished difference Result 136 states and 198 transitions. [2020-07-20 16:35:16,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 16:35:16,038 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 749 [2020-07-20 16:35:16,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 16:35:16,042 INFO L225 Difference]: With dead ends: 136 [2020-07-20 16:35:16,042 INFO L226 Difference]: Without dead ends: 132 [2020-07-20 16:35:16,043 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1506 GetRequests, 1458 SyntacticMatches, 19 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2020-07-20 16:35:16,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-07-20 16:35:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-07-20 16:35:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-07-20 16:35:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2020-07-20 16:35:16,055 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 749 [2020-07-20 16:35:16,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 16:35:16,057 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2020-07-20 16:35:16,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-20 16:35:16,057 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2020-07-20 16:35:16,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-07-20 16:35:16,072 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 16:35:16,072 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 16:35:16,285 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:35:16,286 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 16:35:16,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 16:35:16,286 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 13 times [2020-07-20 16:35:16,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 16:35:16,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1610902183] [2020-07-20 16:35:16,287 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:35:16,991 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 16:35:16,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-20 16:35:16,992 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 16:35:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 16:35:17,255 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 16:35:17,527 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-20 16:35:17,527 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 16:35:17,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 16:35:17,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 04:35:17 BoogieIcfgContainer [2020-07-20 16:35:17,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 16:35:17,937 INFO L168 Benchmark]: Toolchain (without parser) took 59829.78 ms. Allocated memory was 136.8 MB in the beginning and 956.8 MB in the end (delta: 820.0 MB). Free memory was 101.3 MB in the beginning and 647.9 MB in the end (delta: -546.6 MB). Peak memory consumption was 273.4 MB. Max. memory is 7.1 GB. [2020-07-20 16:35:17,938 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 136.8 MB. Free memory was 118.6 MB in the beginning and 118.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-20 16:35:17,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.78 ms. Allocated memory is still 136.8 MB. Free memory was 100.8 MB in the beginning and 91.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-20 16:35:17,939 INFO L168 Benchmark]: Boogie Preprocessor took 28.10 ms. Allocated memory is still 136.8 MB. Free memory was 91.2 MB in the beginning and 89.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-20 16:35:17,940 INFO L168 Benchmark]: RCFGBuilder took 363.84 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 89.8 MB in the beginning and 169.0 MB in the end (delta: -79.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-20 16:35:17,940 INFO L168 Benchmark]: TraceAbstraction took 59187.36 ms. Allocated memory was 200.8 MB in the beginning and 956.8 MB in the end (delta: 756.0 MB). Free memory was 168.3 MB in the beginning and 647.9 MB in the end (delta: -479.6 MB). Peak memory consumption was 276.4 MB. Max. memory is 7.1 GB. [2020-07-20 16:35:17,943 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 136.8 MB. Free memory was 118.6 MB in the beginning and 118.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 242.78 ms. Allocated memory is still 136.8 MB. Free memory was 100.8 MB in the beginning and 91.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.10 ms. Allocated memory is still 136.8 MB. Free memory was 91.2 MB in the beginning and 89.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 363.84 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 89.8 MB in the beginning and 169.0 MB in the end (delta: -79.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59187.36 ms. Allocated memory was 200.8 MB in the beginning and 956.8 MB in the end (delta: 756.0 MB). Free memory was 168.3 MB in the beginning and 647.9 MB in the end (delta: -479.6 MB). Peak memory consumption was 276.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; VAL [x=10] [L25] CALL, EXPR fibo(x) VAL [\old(n)=10] [L6] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L8] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L6] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L8] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) VAL [fibo(x)=55, x=10] [L25] int result = fibo(x); [L26] COND TRUE result == 55 VAL [result=55, x=10] [L27] __VERIFIER_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 58.9s, OverallIterations: 18, TraceHistogramMax: 177, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 339 SDtfs, 2273 SDslu, 1565 SDs, 0 SdLazy, 2298 SolverSat, 2778 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7901 GetRequests, 7304 SyntacticMatches, 195 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3410 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 99 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 43.6s InterpolantComputationTime, 5101 NumberOfCodeBlocks, 3449 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 7719 ConstructedInterpolants, 0 QuantifiedInterpolants, 6019253 SizeOfPredicates, 120 NumberOfNonLiveVariables, 6063 ConjunctsInSsa, 232 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 219715/258556 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...