/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 2 -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-21 15:45:43,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 15:45:43,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 15:45:43,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 15:45:43,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 15:45:43,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 15:45:43,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 15:45:43,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 15:45:43,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 15:45:43,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 15:45:43,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 15:45:43,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 15:45:43,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 15:45:43,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 15:45:43,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 15:45:43,241 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 15:45:43,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 15:45:43,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 15:45:43,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 15:45:43,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 15:45:43,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 15:45:43,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 15:45:43,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 15:45:43,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 15:45:43,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 15:45:43,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 15:45:43,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 15:45:43,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 15:45:43,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 15:45:43,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 15:45:43,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 15:45:43,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 15:45:43,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 15:45:43,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 15:45:43,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 15:45:43,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 15:45:43,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 15:45:43,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 15:45:43,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 15:45:43,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 15:45:43,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 15:45:43,266 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-21 15:45:43,280 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 15:45:43,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 15:45:43,282 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 15:45:43,282 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 15:45:43,282 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 15:45:43,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 15:45:43,283 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 15:45:43,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 15:45:43,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 15:45:43,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 15:45:43,284 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 15:45:43,284 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 15:45:43,284 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 15:45:43,284 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 15:45:43,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 15:45:43,285 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 15:45:43,285 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 15:45:43,285 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 15:45:43,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 15:45:43,285 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 15:45:43,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 15:45:43,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 15:45:43,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 15:45:43,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 15:45:43,286 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 15:45:43,287 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 15:45:43,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:43,287 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 15:45:43,287 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 15:45:43,287 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 -> 2 [2020-07-21 15:45:43,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 15:45:43,596 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 15:45:43,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 15:45:43,601 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 15:45:43,601 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 15:45:43,602 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-21 15:45:43,668 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a855b6b24/8b36fc0dce1d4b3fb56028058ac79c1c/FLAG3801298fa [2020-07-21 15:45:44,116 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 15:45:44,117 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-07-21 15:45:44,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a855b6b24/8b36fc0dce1d4b3fb56028058ac79c1c/FLAG3801298fa [2020-07-21 15:45:44,497 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a855b6b24/8b36fc0dce1d4b3fb56028058ac79c1c [2020-07-21 15:45:44,505 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 15:45:44,507 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 15:45:44,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 15:45:44,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 15:45:44,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 15:45:44,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:45:44" (1/1) ... [2020-07-21 15:45:44,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@485792f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:44, skipping insertion in model container [2020-07-21 15:45:44,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:45:44" (1/1) ... [2020-07-21 15:45:44,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 15:45:44,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 15:45:44,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 15:45:44,744 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 15:45:44,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 15:45:44,775 INFO L208 MainTranslator]: Completed translation [2020-07-21 15:45:44,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:44 WrapperNode [2020-07-21 15:45:44,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 15:45:44,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 15:45:44,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 15:45:44,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 15:45:44,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:44" (1/1) ... [2020-07-21 15:45:44,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:44" (1/1) ... [2020-07-21 15:45:44,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:44" (1/1) ... [2020-07-21 15:45:44,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:44" (1/1) ... [2020-07-21 15:45:44,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:44" (1/1) ... [2020-07-21 15:45:44,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:44" (1/1) ... [2020-07-21 15:45:44,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:44" (1/1) ... [2020-07-21 15:45:44,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 15:45:44,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 15:45:44,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 15:45:44,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 15:45:44,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 15:45:44,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 15:45:44,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 15:45:44,950 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-21 15:45:44,951 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 15:45:44,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 15:45:44,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 15:45:44,951 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-21 15:45:44,951 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 15:45:44,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 15:45:44,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 15:45:45,113 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 15:45:45,113 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-21 15:45:45,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:45:45 BoogieIcfgContainer [2020-07-21 15:45:45,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 15:45:45,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 15:45:45,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 15:45:45,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 15:45:45,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:45:44" (1/3) ... [2020-07-21 15:45:45,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b02ed13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:45:45, skipping insertion in model container [2020-07-21 15:45:45,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:44" (2/3) ... [2020-07-21 15:45:45,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b02ed13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:45:45, skipping insertion in model container [2020-07-21 15:45:45,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:45:45" (3/3) ... [2020-07-21 15:45:45,125 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-07-21 15:45:45,135 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 15:45:45,142 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 15:45:45,156 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 15:45:45,180 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 15:45:45,181 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 15:45:45,181 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 15:45:45,181 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 15:45:45,181 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 15:45:45,181 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 15:45:45,182 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 15:45:45,182 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 15:45:45,200 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-21 15:45:45,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-21 15:45:45,207 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:45,208 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 15:45:45,209 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:45,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:45,215 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-07-21 15:45:45,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:45,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [58067280] [2020-07-21 15:45:45,223 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 15:45:45,277 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 15:45:45,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:45,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 15:45:45,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:45,428 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-21 15:45:45,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 15:45:45,430 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [58067280] [2020-07-21 15:45:45,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 15:45:45,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 15:45:45,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12546414] [2020-07-21 15:45:45,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 15:45:45,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:45,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 15:45:45,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 15:45:45,454 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-07-21 15:45:45,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:45:45,572 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-21 15:45:45,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 15:45:45,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-21 15:45:45,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:45:45,586 INFO L225 Difference]: With dead ends: 35 [2020-07-21 15:45:45,586 INFO L226 Difference]: Without dead ends: 21 [2020-07-21 15:45:45,590 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-21 15:45:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-21 15:45:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-21 15:45:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 15:45:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 15:45:45,637 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-21 15:45:45,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:45:45,638 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 15:45:45,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 15:45:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 15:45:45,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-21 15:45:45,640 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:45,640 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 15:45:45,846 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:45,847 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:45,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:45,848 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-07-21 15:45:45,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:45,850 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [65160085] [2020-07-21 15:45:45,851 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 15:45:45,875 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 15:45:45,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:45,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 15:45:45,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 15:45:45,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 15:45:45,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [65160085] [2020-07-21 15:45:45,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 15:45:45,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 15:45:45,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408374889] [2020-07-21 15:45:45,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 15:45:45,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:45,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 15:45:45,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 15:45:45,921 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-21 15:45:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:45:45,985 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-21 15:45:45,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 15:45:45,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-21 15:45:45,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:45:45,987 INFO L225 Difference]: With dead ends: 27 [2020-07-21 15:45:45,988 INFO L226 Difference]: Without dead ends: 23 [2020-07-21 15:45:45,989 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-21 15:45:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-21 15:45:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-21 15:45:45,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 15:45:45,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 15:45:45,998 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-21 15:45:45,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:45:45,998 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 15:45:45,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 15:45:45,999 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 15:45:46,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-21 15:45:46,000 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:46,000 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-21 15:45:46,214 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:46,215 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:46,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:46,217 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-07-21 15:45:46,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:46,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1343815874] [2020-07-21 15:45:46,219 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 15:45:46,253 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 15:45:46,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:46,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 15:45:46,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:46,306 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-21 15:45:46,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:45:46,471 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:46,517 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-21 15:45:46,517 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1343815874] [2020-07-21 15:45:46,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:45:46,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-21 15:45:46,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606165329] [2020-07-21 15:45:46,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 15:45:46,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:46,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 15:45:46,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-21 15:45:46,521 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-21 15:45:46,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:45:46,626 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-21 15:45:46,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 15:45:46,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-21 15:45:46,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:45:46,628 INFO L225 Difference]: With dead ends: 32 [2020-07-21 15:45:46,628 INFO L226 Difference]: Without dead ends: 28 [2020-07-21 15:45:46,629 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-21 15:45:46,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-21 15:45:46,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-21 15:45:46,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-21 15:45:46,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-21 15:45:46,638 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 26 [2020-07-21 15:45:46,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:45:46,639 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-21 15:45:46,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 15:45:46,639 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-21 15:45:46,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-21 15:45:46,641 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:46,641 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-21 15:45:46,846 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:46,847 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:46,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:46,848 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-07-21 15:45:46,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:46,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [84154782] [2020-07-21 15:45:46,849 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 15:45:46,880 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 15:45:46,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:46,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 15:45:46,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:46,932 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-21 15:45:46,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:45:47,085 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:47,128 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-21 15:45:47,129 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [84154782] [2020-07-21 15:45:47,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:45:47,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-21 15:45:47,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124935775] [2020-07-21 15:45:47,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 15:45:47,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:47,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 15:45:47,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-21 15:45:47,132 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 9 states. [2020-07-21 15:45:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:45:47,236 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2020-07-21 15:45:47,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 15:45:47,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-21 15:45:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:45:47,242 INFO L225 Difference]: With dead ends: 37 [2020-07-21 15:45:47,242 INFO L226 Difference]: Without dead ends: 33 [2020-07-21 15:45:47,243 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-21 15:45:47,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-21 15:45:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2020-07-21 15:45:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-21 15:45:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-21 15:45:47,259 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 27 [2020-07-21 15:45:47,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:45:47,259 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-21 15:45:47,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 15:45:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-21 15:45:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-21 15:45:47,265 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:47,265 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-21 15:45:47,470 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:47,471 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:47,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:47,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2027372739, now seen corresponding path program 2 times [2020-07-21 15:45:47,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:47,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1050517487] [2020-07-21 15:45:47,473 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 15:45:47,509 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 15:45:47,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:47,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 15:45:47,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:47,560 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-21 15:45:47,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:45:47,807 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:47,809 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:47,862 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:47,863 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:47,901 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-21 15:45:47,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1050517487] [2020-07-21 15:45:47,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:45:47,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-21 15:45:47,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650337899] [2020-07-21 15:45:47,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-21 15:45:47,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:47,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-21 15:45:47,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-21 15:45:47,905 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 11 states. [2020-07-21 15:45:48,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:45:48,040 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2020-07-21 15:45:48,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 15:45:48,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-21 15:45:48,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:45:48,043 INFO L225 Difference]: With dead ends: 42 [2020-07-21 15:45:48,043 INFO L226 Difference]: Without dead ends: 38 [2020-07-21 15:45:48,044 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-21 15:45:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-21 15:45:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2020-07-21 15:45:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-21 15:45:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-21 15:45:48,054 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 39 [2020-07-21 15:45:48,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:45:48,055 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-21 15:45:48,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-21 15:45:48,055 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-21 15:45:48,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-21 15:45:48,057 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:48,057 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-21 15:45:48,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:48,260 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:48,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:48,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 2 times [2020-07-21 15:45:48,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:48,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1043314076] [2020-07-21 15:45:48,263 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 15:45:48,302 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 15:45:48,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:48,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 15:45:48,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:48,357 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-21 15:45:48,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:45:48,569 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:48,621 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:48,622 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:48,654 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-21 15:45:48,655 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1043314076] [2020-07-21 15:45:48,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:45:48,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-21 15:45:48,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130072683] [2020-07-21 15:45:48,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-21 15:45:48,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:48,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-21 15:45:48,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-21 15:45:48,657 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 11 states. [2020-07-21 15:45:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:45:48,785 INFO L93 Difference]: Finished difference Result 47 states and 84 transitions. [2020-07-21 15:45:48,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 15:45:48,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2020-07-21 15:45:48,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:45:48,791 INFO L225 Difference]: With dead ends: 47 [2020-07-21 15:45:48,791 INFO L226 Difference]: Without dead ends: 43 [2020-07-21 15:45:48,795 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-21 15:45:48,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-21 15:45:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2020-07-21 15:45:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-21 15:45:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-21 15:45:48,817 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 41 [2020-07-21 15:45:48,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:45:48,818 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-21 15:45:48,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-21 15:45:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-21 15:45:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-21 15:45:48,824 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:48,825 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-21 15:45:49,025 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:49,026 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:49,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:49,026 INFO L82 PathProgramCache]: Analyzing trace with hash -767819153, now seen corresponding path program 3 times [2020-07-21 15:45:49,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:49,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [621558903] [2020-07-21 15:45:49,027 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 15:45:49,066 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 15:45:49,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:49,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 15:45:49,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:49,142 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-21 15:45:49,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:45:49,563 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:49,660 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:49,661 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:49,701 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:49,702 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:49,739 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-21 15:45:49,739 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [621558903] [2020-07-21 15:45:49,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:45:49,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-21 15:45:49,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233647314] [2020-07-21 15:45:49,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 15:45:49,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:49,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 15:45:49,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-21 15:45:49,741 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 13 states. [2020-07-21 15:45:49,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:45:49,916 INFO L93 Difference]: Finished difference Result 52 states and 102 transitions. [2020-07-21 15:45:49,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 15:45:49,917 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2020-07-21 15:45:49,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:45:49,919 INFO L225 Difference]: With dead ends: 52 [2020-07-21 15:45:49,920 INFO L226 Difference]: Without dead ends: 48 [2020-07-21 15:45:49,921 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-21 15:45:49,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-21 15:45:49,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-07-21 15:45:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-21 15:45:49,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-21 15:45:49,932 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 65 [2020-07-21 15:45:49,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:45:49,933 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-21 15:45:49,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 15:45:49,933 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-21 15:45:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-21 15:45:49,935 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:49,936 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-21 15:45:50,148 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:50,149 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:50,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:50,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 3 times [2020-07-21 15:45:50,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:50,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [653444412] [2020-07-21 15:45:50,152 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 15:45:50,196 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 15:45:50,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:50,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-21 15:45:50,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:50,312 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-21 15:45:50,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:45:50,981 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:51,074 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:51,132 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:51,386 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:51,387 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:51,450 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:51,497 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-21 15:45:51,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [653444412] [2020-07-21 15:45:51,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:45:51,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 21 [2020-07-21 15:45:51,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595626882] [2020-07-21 15:45:51,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-21 15:45:51,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:51,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-21 15:45:51,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-07-21 15:45:51,500 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 21 states. [2020-07-21 15:45:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:45:52,034 INFO L93 Difference]: Finished difference Result 94 states and 184 transitions. [2020-07-21 15:45:52,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-21 15:45:52,035 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 96 [2020-07-21 15:45:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:45:52,036 INFO L225 Difference]: With dead ends: 94 [2020-07-21 15:45:52,037 INFO L226 Difference]: Without dead ends: 64 [2020-07-21 15:45:52,041 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-21 15:45:52,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-21 15:45:52,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2020-07-21 15:45:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-21 15:45:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2020-07-21 15:45:52,051 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 96 [2020-07-21 15:45:52,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:45:52,054 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2020-07-21 15:45:52,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-21 15:45:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2020-07-21 15:45:52,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-21 15:45:52,058 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:52,058 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-21 15:45:52,273 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:52,274 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:52,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:52,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2001184551, now seen corresponding path program 4 times [2020-07-21 15:45:52,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:52,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1237043494] [2020-07-21 15:45:52,276 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 15:45:52,328 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 15:45:52,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:52,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 15:45:52,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:52,379 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-21 15:45:52,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:45:52,719 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:52,797 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:52,839 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:52,885 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-21 15:45:52,886 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1237043494] [2020-07-21 15:45:52,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:45:52,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-21 15:45:52,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754406445] [2020-07-21 15:45:52,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 15:45:52,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:52,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 15:45:52,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-21 15:45:52,888 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand 13 states. [2020-07-21 15:45:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:45:53,014 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2020-07-21 15:45:53,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 15:45:53,015 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2020-07-21 15:45:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:45:53,017 INFO L225 Difference]: With dead ends: 65 [2020-07-21 15:45:53,017 INFO L226 Difference]: Without dead ends: 61 [2020-07-21 15:45:53,018 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-21 15:45:53,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-21 15:45:53,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-07-21 15:45:53,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-21 15:45:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2020-07-21 15:45:53,027 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 68 [2020-07-21 15:45:53,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:45:53,027 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2020-07-21 15:45:53,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 15:45:53,027 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2020-07-21 15:45:53,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-07-21 15:45:53,029 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:53,029 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-21 15:45:53,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:53,243 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:53,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:53,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1200034344, now seen corresponding path program 5 times [2020-07-21 15:45:53,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:53,244 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [774703926] [2020-07-21 15:45:53,244 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 15:45:53,311 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 15:45:53,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:53,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-21 15:45:53,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:53,378 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-21 15:45:53,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:45:53,915 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:54,058 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:54,059 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:54,135 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:54,176 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:54,225 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-21 15:45:54,225 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [774703926] [2020-07-21 15:45:54,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:45:54,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-21 15:45:54,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821395128] [2020-07-21 15:45:54,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-21 15:45:54,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:54,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-21 15:45:54,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-21 15:45:54,227 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 15 states. [2020-07-21 15:45:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:45:54,374 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2020-07-21 15:45:54,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-21 15:45:54,375 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 109 [2020-07-21 15:45:54,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:45:54,376 INFO L225 Difference]: With dead ends: 68 [2020-07-21 15:45:54,377 INFO L226 Difference]: Without dead ends: 64 [2020-07-21 15:45:54,377 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 194 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-07-21 15:45:54,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-21 15:45:54,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-07-21 15:45:54,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-21 15:45:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2020-07-21 15:45:54,386 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 109 [2020-07-21 15:45:54,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:45:54,386 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2020-07-21 15:45:54,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-21 15:45:54,387 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2020-07-21 15:45:54,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-07-21 15:45:54,389 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:54,390 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-21 15:45:54,602 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:54,603 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:54,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:54,604 INFO L82 PathProgramCache]: Analyzing trace with hash 706081956, now seen corresponding path program 6 times [2020-07-21 15:45:54,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:54,605 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [527035073] [2020-07-21 15:45:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 15:45:54,688 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 15:45:54,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:54,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-21 15:45:54,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:54,877 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-21 15:45:54,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:45:56,021 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:56,187 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:56,272 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:56,321 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:56,322 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:56,912 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:56,914 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:57,066 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:57,152 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:57,202 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:57,203 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:57,268 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-21 15:45:57,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [527035073] [2020-07-21 15:45:57,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:45:57,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23] total 25 [2020-07-21 15:45:57,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116074538] [2020-07-21 15:45:57,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-21 15:45:57,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:57,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-21 15:45:57,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2020-07-21 15:45:57,270 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand 25 states. [2020-07-21 15:45:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:45:57,968 INFO L93 Difference]: Finished difference Result 144 states and 221 transitions. [2020-07-21 15:45:57,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-21 15:45:57,969 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 218 [2020-07-21 15:45:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:45:57,972 INFO L225 Difference]: With dead ends: 144 [2020-07-21 15:45:57,972 INFO L226 Difference]: Without dead ends: 88 [2020-07-21 15:45:57,974 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 391 SyntacticMatches, 21 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=539, Invalid=1531, Unknown=0, NotChecked=0, Total=2070 [2020-07-21 15:45:57,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-21 15:45:57,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2020-07-21 15:45:57,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-21 15:45:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2020-07-21 15:45:57,985 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 218 [2020-07-21 15:45:57,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:45:57,985 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2020-07-21 15:45:57,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-21 15:45:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2020-07-21 15:45:57,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-07-21 15:45:57,988 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:57,988 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-21 15:45:58,202 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:58,205 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:58,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:58,206 INFO L82 PathProgramCache]: Analyzing trace with hash 259499213, now seen corresponding path program 7 times [2020-07-21 15:45:58,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:58,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [234860938] [2020-07-21 15:45:58,206 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 15:45:58,323 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 15:45:58,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:58,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 15:45:58,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:58,408 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-21 15:45:58,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:45:59,307 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:59,308 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:59,538 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:59,686 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:59,686 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:59,766 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:59,807 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:59,868 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-21 15:45:59,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [234860938] [2020-07-21 15:45:59,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:45:59,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2020-07-21 15:45:59,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076753690] [2020-07-21 15:45:59,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-21 15:45:59,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:59,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-21 15:45:59,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-21 15:45:59,871 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand 17 states. [2020-07-21 15:46:00,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:46:00,079 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2020-07-21 15:46:00,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 15:46:00,079 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 177 [2020-07-21 15:46:00,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:46:00,081 INFO L225 Difference]: With dead ends: 85 [2020-07-21 15:46:00,082 INFO L226 Difference]: Without dead ends: 81 [2020-07-21 15:46:00,082 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-21 15:46:00,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-21 15:46:00,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-07-21 15:46:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-21 15:46:00,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 107 transitions. [2020-07-21 15:46:00,091 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 107 transitions. Word has length 177 [2020-07-21 15:46:00,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:46:00,092 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 107 transitions. [2020-07-21 15:46:00,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-21 15:46:00,092 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2020-07-21 15:46:00,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-21 15:46:00,096 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:46:00,097 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-21 15:46:00,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:46:00,312 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:46:00,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:46:00,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1425621089, now seen corresponding path program 8 times [2020-07-21 15:46:00,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:46:00,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [228303076] [2020-07-21 15:46:00,313 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 15:46:00,468 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 15:46:00,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:46:00,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-21 15:46:00,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:46:00,605 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-21 15:46:00,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:46:02,039 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:02,040 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:02,460 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:02,714 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:02,716 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:02,865 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:02,946 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:02,989 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:03,078 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-21 15:46:03,078 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [228303076] [2020-07-21 15:46:03,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:46:03,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 19 [2020-07-21 15:46:03,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662694430] [2020-07-21 15:46:03,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-21 15:46:03,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:46:03,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-21 15:46:03,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-07-21 15:46:03,081 INFO L87 Difference]: Start difference. First operand 81 states and 107 transitions. Second operand 19 states. [2020-07-21 15:46:03,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:46:03,338 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2020-07-21 15:46:03,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 15:46:03,338 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 286 [2020-07-21 15:46:03,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:46:03,341 INFO L225 Difference]: With dead ends: 90 [2020-07-21 15:46:03,341 INFO L226 Difference]: Without dead ends: 86 [2020-07-21 15:46:03,342 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-21 15:46:03,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-21 15:46:03,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-07-21 15:46:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-07-21 15:46:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2020-07-21 15:46:03,361 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 120 transitions. Word has length 286 [2020-07-21 15:46:03,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:46:03,365 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 120 transitions. [2020-07-21 15:46:03,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-21 15:46:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2020-07-21 15:46:03,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2020-07-21 15:46:03,372 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:46:03,373 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-21 15:46:03,573 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:46:03,574 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:46:03,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:46:03,574 INFO L82 PathProgramCache]: Analyzing trace with hash -350328107, now seen corresponding path program 9 times [2020-07-21 15:46:03,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:46:03,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [284087014] [2020-07-21 15:46:03,575 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 15:46:03,789 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 15:46:03,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:46:03,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-21 15:46:03,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:46:04,140 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-21 15:46:04,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:46:07,158 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:07,431 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:07,432 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:07,595 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:07,708 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:07,709 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:07,761 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:07,762 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:08,753 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:08,754 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:09,009 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:09,010 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:09,185 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:09,185 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:09,273 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:09,274 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:09,326 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:09,495 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-21 15:46:09,496 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [284087014] [2020-07-21 15:46:09,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:46:09,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 27] total 29 [2020-07-21 15:46:09,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013391082] [2020-07-21 15:46:09,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-07-21 15:46:09,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:46:09,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-07-21 15:46:09,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2020-07-21 15:46:09,498 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand 29 states. [2020-07-21 15:46:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:46:10,677 INFO L93 Difference]: Finished difference Result 187 states and 314 transitions. [2020-07-21 15:46:10,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-07-21 15:46:10,677 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 504 [2020-07-21 15:46:10,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:46:10,680 INFO L225 Difference]: With dead ends: 187 [2020-07-21 15:46:10,680 INFO L226 Difference]: Without dead ends: 109 [2020-07-21 15:46:10,683 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1033 GetRequests, 955 SyntacticMatches, 25 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=747, Invalid=2223, Unknown=0, NotChecked=0, Total=2970 [2020-07-21 15:46:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-21 15:46:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2020-07-21 15:46:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-21 15:46:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2020-07-21 15:46:10,709 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 504 [2020-07-21 15:46:10,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:46:10,710 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2020-07-21 15:46:10,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-07-21 15:46:10,710 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2020-07-21 15:46:10,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-07-21 15:46:10,715 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:46:10,716 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-21 15:46:10,929 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:46:10,930 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:46:10,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:46:10,930 INFO L82 PathProgramCache]: Analyzing trace with hash -229001048, now seen corresponding path program 10 times [2020-07-21 15:46:10,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:46:10,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1608214962] [2020-07-21 15:46:10,931 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 15:46:11,190 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 15:46:11,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:46:11,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-21 15:46:11,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:46:11,434 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-21 15:46:11,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:46:13,632 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:13,633 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:14,362 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:14,363 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:14,775 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:14,776 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:15,020 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:15,187 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:15,274 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:15,274 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:15,321 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:15,322 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:15,455 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-21 15:46:15,456 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1608214962] [2020-07-21 15:46:15,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:46:15,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 21 [2020-07-21 15:46:15,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69054007] [2020-07-21 15:46:15,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-21 15:46:15,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:46:15,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-21 15:46:15,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-07-21 15:46:15,458 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand 21 states. [2020-07-21 15:46:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:46:15,779 INFO L93 Difference]: Finished difference Result 107 states and 153 transitions. [2020-07-21 15:46:15,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-21 15:46:15,780 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 463 [2020-07-21 15:46:15,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:46:15,784 INFO L225 Difference]: With dead ends: 107 [2020-07-21 15:46:15,784 INFO L226 Difference]: Without dead ends: 103 [2020-07-21 15:46:15,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 933 GetRequests, 890 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2020-07-21 15:46:15,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-21 15:46:15,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-07-21 15:46:15,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-07-21 15:46:15,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2020-07-21 15:46:15,793 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 463 [2020-07-21 15:46:15,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:46:15,794 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2020-07-21 15:46:15,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-21 15:46:15,795 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2020-07-21 15:46:15,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2020-07-21 15:46:15,803 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:46:15,804 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-21 15:46:16,004 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:46:16,005 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:46:16,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:46:16,006 INFO L82 PathProgramCache]: Analyzing trace with hash -928557949, now seen corresponding path program 11 times [2020-07-21 15:46:16,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:46:16,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1551416590] [2020-07-21 15:46:16,007 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 15:46:16,373 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 15:46:16,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:46:16,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 1485 conjuncts, 32 conjunts are in the unsatisfiable core [2020-07-21 15:46:16,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:46:17,239 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-21 15:46:17,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:46:23,191 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:23,192 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:23,825 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:24,281 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:24,282 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:24,556 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:24,723 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:24,823 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:24,884 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:26,546 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:26,547 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:27,001 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:27,001 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:27,276 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:27,277 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:27,448 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:27,556 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:27,617 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:27,618 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:28,063 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-21 15:46:28,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1551416590] [2020-07-21 15:46:28,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:46:28,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 33] total 37 [2020-07-21 15:46:28,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313742146] [2020-07-21 15:46:28,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-07-21 15:46:28,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:46:28,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-07-21 15:46:28,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1124, Unknown=0, NotChecked=0, Total=1332 [2020-07-21 15:46:28,067 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand 37 states. [2020-07-21 15:46:29,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:46:29,918 INFO L93 Difference]: Finished difference Result 257 states and 498 transitions. [2020-07-21 15:46:29,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-07-21 15:46:29,919 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 994 [2020-07-21 15:46:29,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:46:29,923 INFO L225 Difference]: With dead ends: 257 [2020-07-21 15:46:29,923 INFO L226 Difference]: Without dead ends: 162 [2020-07-21 15:46:29,927 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2023 GetRequests, 1923 SyntacticMatches, 29 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1231, Invalid=4025, Unknown=0, NotChecked=0, Total=5256 [2020-07-21 15:46:29,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-07-21 15:46:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 129. [2020-07-21 15:46:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-07-21 15:46:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 186 transitions. [2020-07-21 15:46:29,938 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 186 transitions. Word has length 994 [2020-07-21 15:46:29,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:46:29,939 INFO L479 AbstractCegarLoop]: Abstraction has 129 states and 186 transitions. [2020-07-21 15:46:29,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-07-21 15:46:29,939 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 186 transitions. [2020-07-21 15:46:29,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2020-07-21 15:46:29,945 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:46:29,946 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-21 15:46:30,154 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:46:30,155 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:46:30,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:46:30,156 INFO L82 PathProgramCache]: Analyzing trace with hash -127293739, now seen corresponding path program 12 times [2020-07-21 15:46:30,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:46:30,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1820483244] [2020-07-21 15:46:30,158 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 15:46:30,611 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 15:46:30,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:46:30,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 1665 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-21 15:46:30,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:46:30,979 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-21 15:46:30,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:46:34,315 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:35,499 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:36,235 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:36,697 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:36,698 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:36,970 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:36,971 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:37,136 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:37,231 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:37,292 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:46:37,573 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-21 15:46:37,574 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1820483244] [2020-07-21 15:46:37,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:46:37,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 22 [2020-07-21 15:46:37,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146631856] [2020-07-21 15:46:37,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-21 15:46:37,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:46:37,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-21 15:46:37,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-07-21 15:46:37,577 INFO L87 Difference]: Start difference. First operand 129 states and 186 transitions. Second operand 22 states. [2020-07-21 15:46:37,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:46:37,855 INFO L93 Difference]: Finished difference Result 136 states and 198 transitions. [2020-07-21 15:46:37,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 15:46:37,856 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 749 [2020-07-21 15:46:37,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:46:37,859 INFO L225 Difference]: With dead ends: 136 [2020-07-21 15:46:37,859 INFO L226 Difference]: Without dead ends: 132 [2020-07-21 15:46:37,860 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1506 GetRequests, 1458 SyntacticMatches, 19 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2020-07-21 15:46:37,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-07-21 15:46:37,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-07-21 15:46:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-07-21 15:46:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2020-07-21 15:46:37,870 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 749 [2020-07-21 15:46:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:46:37,871 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2020-07-21 15:46:37,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-21 15:46:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2020-07-21 15:46:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-07-21 15:46:37,885 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:46:37,886 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-21 15:46:38,099 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:46:38,100 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:46:38,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:46:38,100 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 13 times [2020-07-21 15:46:38,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:46:38,100 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [506517872] [2020-07-21 15:46:38,101 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 15:46:38,738 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 15:46:38,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-21 15:46:38,739 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 15:46:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 15:46:38,978 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 15:46:39,234 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 15:46:39,234 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 15:46:39,447 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:46:39,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 03:46:39 BoogieIcfgContainer [2020-07-21 15:46:39,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 15:46:39,639 INFO L168 Benchmark]: Toolchain (without parser) took 55132.13 ms. Allocated memory was 143.7 MB in the beginning and 917.5 MB in the end (delta: 773.8 MB). Free memory was 101.4 MB in the beginning and 279.5 MB in the end (delta: -178.0 MB). Peak memory consumption was 595.8 MB. Max. memory is 7.1 GB. [2020-07-21 15:46:39,640 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 143.7 MB. Free memory is still 119.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-21 15:46:39,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.57 ms. Allocated memory is still 143.7 MB. Free memory was 101.0 MB in the beginning and 91.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2020-07-21 15:46:39,641 INFO L168 Benchmark]: Boogie Preprocessor took 28.85 ms. Allocated memory is still 143.7 MB. Free memory was 91.9 MB in the beginning and 90.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-21 15:46:39,642 INFO L168 Benchmark]: RCFGBuilder took 310.99 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 90.7 MB in the beginning and 168.1 MB in the end (delta: -77.4 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-21 15:46:39,642 INFO L168 Benchmark]: TraceAbstraction took 54518.92 ms. Allocated memory was 200.8 MB in the beginning and 917.5 MB in the end (delta: 716.7 MB). Free memory was 168.1 MB in the beginning and 279.5 MB in the end (delta: -111.3 MB). Peak memory consumption was 605.4 MB. Max. memory is 7.1 GB. [2020-07-21 15:46:39,645 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.23 ms. Allocated memory is still 143.7 MB. Free memory is still 119.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 267.57 ms. Allocated memory is still 143.7 MB. Free memory was 101.0 MB in the beginning and 91.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.85 ms. Allocated memory is still 143.7 MB. Free memory was 91.9 MB in the beginning and 90.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 310.99 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 90.7 MB in the beginning and 168.1 MB in the end (delta: -77.4 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54518.92 ms. Allocated memory was 200.8 MB in the beginning and 917.5 MB in the end (delta: 716.7 MB). Free memory was 168.1 MB in the beginning and 279.5 MB in the end (delta: -111.3 MB). Peak memory consumption was 605.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: 54.2s, OverallIterations: 18, TraceHistogramMax: 177, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 339 SDtfs, 2273 SDslu, 1565 SDs, 0 SdLazy, 2321 SolverSat, 2786 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7901 GetRequests, 7304 SyntacticMatches, 195 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3410 ImplicationChecksByTransitivity, 6.2s 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, 40.2s InterpolantComputationTime, 5101 NumberOfCodeBlocks, 4195 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 7719 ConstructedInterpolants, 0 QuantifiedInterpolants, 6019253 SizeOfPredicates, 120 NumberOfNonLiveVariables, 7353 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...